=Paper=
{{Paper
|id=Vol-3263/invited-3
|storemode=property
|title=Charting the Borderland – Decidability in Description Logics and Beyond (DL Invited Talk Abstract)
|pdfUrl=https://ceur-ws.org/Vol-3263/invited-3.pdf
|volume=Vol-3263
|authors=Sebastian Rudolph
|dblpUrl=https://dblp.org/rec/conf/dlog/Rudolph22
}}
==Charting the Borderland – Decidability in Description Logics and Beyond (DL Invited Talk Abstract)==
<pdf width="1500px">https://ceur-ws.org/Vol-3263/invited-3.pdf</pdf>
<pre>
Charting the Borderland – Decidability in
Description Logics and Beyond
DL Invited Talk Abstract

Sebastian Rudolph
Computational Logic Group, TU Dresden, 01062 Dresden, Germany

Keywords
Decidability, query entailment, ontology-mediated queries


   Decidability of inferencing is commonly considered a very important property of logic-based
knowledge representation formalisms, required for the algorithmization and automation of
reasoning. Yet, oftentimes, the corresponding (un)decidability arguments are idiosyncratic and
do not shed much light on the underlying principles governing the divide.
   In my talk, I will review generic model- and proof-theoretic criteria for decidability of querying
in fragments of first-order logic. Description logics play a central role in these considerations:
They can serve as a simplified “testbed” inspiring decidability criteria which can then be
generalized to higher arities.
   On the model-theoretic side, I will describe a general framework by means of which decid-
ability of query entailment can be established based on the existence of countermodels with
certain structural properties. These properties depend on the ontology and query language
used and range from finite domain over forest-like shape to width-finiteness employing width
notions like treewidth and cliquewidth.
   On the proof-theoretic side, I will report on a recent result according to which decidable
homomorphism-closed queries can be captured by a rather restricted ontology-mediated query-
ing framework based on existential rules with certain chase termination guarantees.




              DL 2022: 35th International Workshop on Description Logics, August 7–10, 2022, Haifa, Israel
Envelope-Open sebastian.rudolph@tu-dresden.de (S. Rudolph)
GLOBE https://iccl.inf.tu-dresden.de/web/Sebastian_Rudolph/en (S. Rudolph)
Orcid 0000-0002-1609-2080 (S. Rudolph)
                                    © 2022 Copyright for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).
 CEUR
 Workshop
 Proceedings
               http://ceur-ws.org
               ISSN 1613-0073
                                    CEUR Workshop Proceedings (CEUR-WS.org)

</pre>