BibTeX Export for Dagstuhl Reports, Volume 11, Issue 8

Copy to Clipboard Download

@Article{DagRep.11.8,
  title =	{{Dagstuhl Reports, Volume 11, Issue 8, September 2021, Complete Issue}},
  pages =	{1--130},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2022},
  volume =	{11},
  number =	{8},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.11.8},
  URN =		{urn:nbn:de:0030-drops-157647},
  doi =		{10.4230/DagRep.11.8},
  annote =	{Keywords: Dagstuhl Reports, Volume 11, Issue 8, September 2021, Complete Issue}
}
@Article{DagRep.11.8.i,
  title =	{{Dagstuhl Reports, Table of Contents, Volume 11, Issue 8, 2021}},
  pages =	{i--ii},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2022},
  volume =	{11},
  number =	{8},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.11.8.i},
  URN =		{urn:nbn:de:0030-drops-157655},
  doi =		{10.4230/DagRep.11.8.i},
  annote =	{Keywords: Table of Contents, Frontmatter}
}
@Article{marquessilva_et_al:DagRep.11.8.1,
  author =	{Marques-Silva, Joao and Pe\~{n}aloza, Rafael and Sattler, Uli},
  title =	{{Extending the Synergies Between SAT and Description Logics (Dagstuhl Seminar 21361)}},
  pages =	{1--10},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2022},
  volume =	{11},
  number =	{8},
  editor =	{Marques-Silva, Joao and Pe\~{n}aloza, Rafael and Sattler, Uli},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.11.8.1},
  URN =		{urn:nbn:de:0030-drops-157661},
  doi =		{10.4230/DagRep.11.8.1},
  annote =	{Keywords: description logics, propositional satisfiability, reasoning services, standard and non-standard inferences}
}
@Article{dong_et_al:DagRep.11.8.11,
  author =	{Dong, Tiansi and Rettinger, Achim and Tang, Jie and Tversky, Barbara and van Harmelen, Frank},
  title =	{{Structure and Learning (Dagstuhl Seminar 21362)}},
  pages =	{11--34},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2022},
  volume =	{11},
  number =	{8},
  editor =	{Dong, Tiansi and Rettinger, Achim and Tang, Jie and Tversky, Barbara and van Harmelen, Frank},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.11.8.11},
  URN =		{urn:nbn:de:0030-drops-157670},
  doi =		{10.4230/DagRep.11.8.11},
  annote =	{Keywords: Knowledge graph, Machine learning, Neural-symbol unification}
}
@Article{bonacina_et_al:DagRep.11.8.35,
  author =	{Bonacina, Maria Paola and R\"{u}mmer, Philipp and Schmidt, Renate A.},
  title =	{{Integrated Deduction (Dagstuhl Seminar 21371)}},
  pages =	{35--51},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2022},
  volume =	{11},
  number =	{8},
  editor =	{Bonacina, Maria Paola and R\"{u}mmer, Philipp and Schmidt, Renate A.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.11.8.35},
  URN =		{urn:nbn:de:0030-drops-157685},
  doi =		{10.4230/DagRep.11.8.35},
  annote =	{Keywords: Automated theorem proving, deduction, logic, reasoning, SMT solving}
}
@Article{dezani_et_al:DagRep.11.8.52,
  author =	{Dezani, Mariangiola and Kuhn, Roland and Lindley, Sam and Scalas, Alceste},
  title =	{{Behavioural Types: Bridging Theory and Practice (Dagstuhl Seminar 21372)}},
  pages =	{52--75},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2022},
  volume =	{11},
  number =	{8},
  editor =	{Dezani, Mariangiola and Kuhn, Roland and Lindley, Sam and Scalas, Alceste},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.11.8.52},
  URN =		{urn:nbn:de:0030-drops-157699},
  doi =		{10.4230/DagRep.11.8.52},
  annote =	{Keywords: behavioural types, concurrency, programming languages, session types}
}
@Article{law_et_al:DagRep.11.8.76,
  author =	{Law, Effie Lai-Chong and F{\o}lstad, Asbj{\o}rn and Grudin, Jonathan and Schuller, Bj\"{o}rn},
  title =	{{Conversational Agent as Trustworthy Autonomous System (Trust-CA) (Dagstuhl Seminar 21381)}},
  pages =	{76--114},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2022},
  volume =	{11},
  number =	{8},
  editor =	{Law, Effie Lai-Chong and F{\o}lstad, Asbj{\o}rn and Grudin, Jonathan and Schuller, Bj\"{o}rn},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.11.8.76},
  URN =		{urn:nbn:de:0030-drops-157702},
  doi =		{10.4230/DagRep.11.8.76},
  annote =	{Keywords: Conversational agents, Trust, Trustworthiness, Autonomous Systems}
}
@Article{kral'_et_al:DagRep.11.8.115,
  author =	{Kr\'{a}l’, Daniel and Pilipczuk, Micha{\l} and Siebertz, Sebastian and Sullivan, Blair D.},
  title =	{{Sparsity in Algorithms, Combinatorics and Logic (Dagstuhl Seminar 21391)}},
  pages =	{115--128},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2022},
  volume =	{11},
  number =	{8},
  editor =	{Kr\'{a}l’, Daniel and Pilipczuk, Micha{\l} and Siebertz, Sebastian and Sullivan, Blair D.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.11.8.115},
  URN =		{urn:nbn:de:0030-drops-157718},
  doi =		{10.4230/DagRep.11.8.115},
  annote =	{Keywords: Algorithm design, Parameterised complexity, Sparse graphs, Graph decompositions, Model theory}
}

The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.

Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode