Inproceedings,

Querying circumscribed description logic knowledge bases

, , and .
Proceedings of the Twentieth International Conference on Principles of Knowledge Representation and Reasoning, page 482--491. California, International Joint Conferences on Artificial Intelligence Organization, (September 2023)

Abstract

Circumscription is one of the main approaches for defining non-monotonic description logics (DLs) and the decidability and complexity of traditional reasoning tasks, such as satisfiability of circumscribed DL knowledge bases (KBs) are well understood. For evaluating conjunctive queries (CQs) and unions thereof (UCQs), in contrast, 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).

Tags

    Users

    • @scadsfct

    Comments and Reviews