DagRep.11.8.1.pdf
- Filesize: 7.41 MB
- 10 pages
Document
Extending the Synergies Between SAT and Description Logics (Dagstuhl Seminar 21361)
Authors and all authors of the abstracts in this report
-
Part of:
Issue:
Dagstuhl Reports, Volume 11, Issue 8
Volume: Dagstuhl Reports, Volume 11
Journal: Dagstuhl Reports (DagRep) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2022-02-18
Cite As Get BibTex
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)
https://doi.org/10.4230/DagRep.11.8.1
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.
Subject Classification
ACM Subject Classification
- Theory of computation → Complexity theory and logic
- Theory of computation → Description logics
- Theory of computation → Logic and verification
Keywords
- description logics
- propositional satisfiability
- reasoning services
- standard and non-standard inferences
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads