Querying Circumscribed Description Logic Knowledge Bases

Autor:	Lutz, Carsten, Manière, Quentin, Nolte, Robin
Rok vydání:	2023
Předmět:	Computer Science - Artificial Intelligence Computer Science - Computational Complexity Computer Science - Logic in Computer Science
Druh dokumentu:	Working Paper
Popis:	Circumscription is one of the main approaches for defining non-monotonic description logics (DLs). While the decidability and complexity of traditional reasoning tasks such as satisfiability of circumscribed DL knowledge bases (KBs) is well understood, for evaluating conjunctive queries (CQs) and unions thereof (UCQs), not even decidability had been established. In this paper, we prove decidability of (U)CQ evaluation on circumscribed DL KBs and obtain a rather complete picture of both the combined complexity and the data complexity, for DLs ranging from ALCHIO via EL to various versions of DL-Lite. We also study the much simpler atomic queries (AQs). Comment: 42 pages - Extended version of a paper accepted at KR 2023
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2306.04546 Zobrazit plný text záznamu View this record from Arxiv