C. Lutz, Q. Manière, and R. Nolte. 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).
Proceedings of the Twentieth International Conference on Principles of Knowledge Representation and Reasoning
year
2023
month
sep
pages
482--491
publisher
International Joint Conferences on Artificial Intelligence Organization
conference
20th International Conference on Principles of Knowledge Representation and Reasoning \KR-2023\
location
Rhodes, Greece
Tags
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 Lutz2023-qr
%A Lutz, Carsten
%A Manière, Quentin
%A Nolte, Robin
%B Proceedings of the Twentieth International Conference on Principles of Knowledge Representation and Reasoning
%C California
%D 2023
%I International Joint Conferences on Artificial Intelligence Organization
%K
%P 482--491
%T Querying circumscribed description logic knowledge bases
%X 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).
@inproceedings{Lutz2023-qr,
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).},
added-at = {2024-09-10T10:41:24.000+0200},
address = {California},
author = {Lutz, Carsten and Mani{\`e}re, Quentin and Nolte, Robin},
biburl = {https://puma.scadsai.uni-leipzig.de/bibtex/2b9f4a385a9fec0f54c40106f558acaee/scadsfct},
booktitle = {Proceedings of the Twentieth International Conference on Principles of Knowledge Representation and Reasoning},
conference = {20th International Conference on Principles of Knowledge Representation and Reasoning \{KR-2023\}},
interhash = {e248b0ae0d35696383b98d28653cc7bc},
intrahash = {b9f4a385a9fec0f54c40106f558acaee},
keywords = {},
location = {Rhodes, Greece},
month = sep,
pages = {482--491},
publisher = {International Joint Conferences on Artificial Intelligence Organization},
timestamp = {2024-09-10T10:47:32.000+0200},
title = {Querying circumscribed description logic knowledge bases},
year = 2023
}