Issue
Dagstuhl Reports, Volume 11, Issue 8
-
Part of:
Volume:
Dagstuhl Reports, Volume 11
Journal: Dagstuhl Reports (DagRep)
Publication Details
- published at: 2022-02-18
- Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
- DBLP: db/journals/dagstuhl-reports/dagstuhl-reports11
Access Numbers
- Detailed Access Statistics available here
-
Total Document Accesses (updated on a weekly basis):
0PDF Downloads
Documents
No documents found matching your filter selection.
Document
Complete Issue
Dagstuhl Reports, Volume 11, Issue 8, September 2021, Complete Issue
Abstract
Dagstuhl Reports, Volume 11, Issue 8, September 2021, Complete Issue
Cite as
Dagstuhl Reports, Volume 11, Issue 8, pp. 1-130, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
Copy BibTex To Clipboard
@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-dev.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}
}
Document
Front Matter
Dagstuhl Reports, Table of Contents, Volume 11, Issue 8, 2021
Abstract
Dagstuhl Reports, Table of Contents, Volume 11, Issue 8, 2021
Cite as
Dagstuhl Reports, Volume 11, Issue 8, pp. i-ii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
Copy BibTex To Clipboard
@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-dev.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}
}
Document
Extending the Synergies Between SAT and Description Logics (Dagstuhl Seminar 21361)
Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 21361 "Extending the Synergies Between SAT and Description Logics". Propositional satisfiability (SAT) and description logics (DL) are two successful areas of computational logic where automated reasoning plays a fundamental role. While they share a common core (formalised on logic), the developments in both areas have diverged in their scopes, methods, and applications. The goal of this seminar was to reconnect the SAT and DL communities (understood in a broad sense) so that they can benefit from each other. The seminar thus focused on explaining the foundational principles, main results, and open problems of each area, and discussing potential avenues for collaborative progress.
Cite as
Joao Marques-Silva, Rafael Peñaloza, and Uli Sattler. Extending the Synergies Between SAT and Description Logics (Dagstuhl Seminar 21361). In Dagstuhl Reports, Volume 11, Issue 8, pp. 1-10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
Copy BibTex To Clipboard
@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-dev.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}
}
Document
Structure and Learning (Dagstuhl Seminar 21362)
Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 21362 "Structure and Learning", held from September 5 to 10, 2021. Structure and learning are among the most prominent topics in Artificial Intelligence (AI) today. Integrating symbolic and numeric inference was set as one of the next open AI problems at the Townhall meeting "A 20 Year Roadmap for AI" at AAAI 2019. In this Dagstuhl seminar, we discussed related problems from an interdiscplinary perspective, in particular, Cognitive Science, Cognitive Psychology, Physics, Computational Humor, Linguistic, Machine Learning, and AI. This report overviews presentations and working groups during the seminar, and lists two open problems.
Cite as
Tiansi Dong, Achim Rettinger, Jie Tang, Barbara Tversky, and Frank van Harmelen. Structure and Learning (Dagstuhl Seminar 21362). In Dagstuhl Reports, Volume 11, Issue 8, pp. 11-34, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
Copy BibTex To Clipboard
@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-dev.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}
}
Document
Integrated Deduction (Dagstuhl Seminar 21371)
Abstract
Logical reasoning plays a key role in fields as diverse as verification and synthesis, programming language foundations, knowledge engineering, and computer mathematics. Logical reasoning is increasingly important in intelligent systems, such as decision support systems, agent programming environments, and data processing systems, where deduction may provide explanation, course of action, and the capability of learning from missing information. Problem formalization in these domains typically involves multiple mathematical theories, knowledge bases, and ontologies, all of which may be very large. Problem solving requires both efficient automation and sophisticated human-machine interaction. The thrust of this seminar was that the key to unleash the power of computerized logical reasoning is integration, at different abstraction levels.
This seminar offered a forum to discuss the issues related to integration of deduction in a diverse range of applications. In terms of reasoning procedures, the presence of both theories and quantifiers in problems from many contexts calls for methodologies to integrate state-of-the-art SMT solvers and automated theorem provers. This leads to investigate techniques such as model-based reasoning and semantic guidance, that were presented and discussed at the seminar. Similarly, the integration of inference rules for higher-order reasoning in inference systems that were born for first-order reasoning, such as superposition, was prominent among the topics debated at the seminar. At the architectural level, the sheer difficulty of the problems calls for the integration of provers and solvers into interactive reasoning environments. These range from higher-order proof assistants with background reasoners as hammers, to interactive program verifiers, both widely covered at the seminar in talks and discussions.
The seminar showed how the application of deduction to intelligent systems necessitates the integration of deduction with other paradigms, such as probabilistic reasoning and statistical inferences. In fact, it emerged from the seminar that even systems that are not natively deductive, such as agent programming environments and industrial tools for ontology-based processing, benefit significantly from the integration of deduction. A clear and shared uptake from the seminar was that scalability and usability are crucial challenges at all levels of integration. The seminar fully succeded in promoting the exchange of new ideas and suggestions for future research.
Cite as
Maria Paola Bonacina, Philipp Rümmer, and Renate A. Schmidt. Integrated Deduction (Dagstuhl Seminar 21371). In Dagstuhl Reports, Volume 11, Issue 8, pp. 35-51, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
Copy BibTex To Clipboard
@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-dev.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}
}
Document
Behavioural Types: Bridging Theory and Practice (Dagstuhl Seminar 21372)
Abstract
Behavioural types specify the way in which software components interact with one another. Unlike data types (which describe the structure of data), behavioural types describe communication protocols, and their verification ensures that programs do not violate such protocols. The behavioural types research community has developed a flourishing literature on communication-centric programming, exploring many directions. One of the most studied behavioural type systems are session types, introduced by Honda et al. in the ‘90s, and awarded with prizes for their influence in the past 20 and 10 years (by the ESOP and POPL conferences, respectively). Other varieties of behavioural types include typestate systems, choreographies, and behavioural contracts; research on verification techniques covers the spectrum from fully static verification at compile-time to fully dynamic verification at run-time.
In the last decade, research on behavioural types has shifted emphasis towards practical applications, using both novel and existing programming languages (e.g., Java, Python, Go, C, Haskell, OCaml, Erlang, Scala, Rust). An earlier Dagstuhl Seminar, 17051 "Theory and Applications of Behavioural Types" (January 29-February 3, 2017), played an important role in coordinating this effort. Yet, despite the vibrant community and the stream of new results, the use of behavioural types for mainstream software development and verification remains limited.
This limitation is largely down to the rapid pace at which mainstream industrial practice for the design and development of concurrent and distributed systems evolves, often resulting in substantial divergence from academic research. In the absence of established tools to express communication protocols, widely used implementations concentrate solely on scalability and reliability. The flip side is that these systems are either overly loose, supporting any conceivable communication structure (via brokers), or overly restricted, supporting only simple request-response protocols (like HTTP or RPC).
In this seminar, experts from academia and industry explored together how best to bridge the gap between theory and mainstream practice. They tackled challenges that are fundamental in practical systems development, but are rarely or only partially addressed in the behavioural types literature - in particular, failure handling, asynchronous communication, and dynamic reconfiguration. Moreover they explored how the tools of behavioural types and programming languages theory (such as linearity, gradual types, and dependent types) can help to address these challenges.
Cite as
Mariangiola Dezani, Roland Kuhn, Sam Lindley, and Alceste Scalas. Behavioural Types: Bridging Theory and Practice (Dagstuhl Seminar 21372). In Dagstuhl Reports, Volume 11, Issue 8, pp. 52-75, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
Copy BibTex To Clipboard
@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-dev.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}
}
Document
Conversational Agent as Trustworthy Autonomous System (Trust-CA) (Dagstuhl Seminar 21381)
Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 21381 "Conversational Agent as Trustworthy Autonomous System (Trust-CA)". First, we present the abstracts of the talks delivered by the Seminar’s attendees. Then we report on the origin and process of our six breakout (working) groups. For each group, we describe its contributors, goals and key questions, key insights, and future research. The themes of the groups were derived from a pre-Seminar survey, which also led to a list of suggested readings for the topic of trust in conversational agents. The list is included in this report for references.
Cite as
Effie Lai-Chong Law, Asbjørn Følstad, Jonathan Grudin, and Björn Schuller. Conversational Agent as Trustworthy Autonomous System (Trust-CA) (Dagstuhl Seminar 21381). In Dagstuhl Reports, Volume 11, Issue 8, pp. 76-114, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
Copy BibTex To Clipboard
@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-dev.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}
}
Document
Sparsity in Algorithms, Combinatorics and Logic (Dagstuhl Seminar 21391)
Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 21391 "Sparsity in Algorithms, Combinatorics and Logic". The seminar took place in a hybrid format from September 26 - October 1, 2021 and brought together 61 researchers. This report includes a discussion of the motivation of the seminar, presentation of the overall organization, abstracts of talks, and a report from each of the working groups.
Cite as
Daniel Král’, Michał Pilipczuk, Sebastian Siebertz, and Blair D. Sullivan. Sparsity in Algorithms, Combinatorics and Logic (Dagstuhl Seminar 21391). In Dagstuhl Reports, Volume 11, Issue 8, pp. 115-128, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
Copy BibTex To Clipboard
@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-dev.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}
}