Bonatti, P., Di Stefano, F., Ortiz, M., & Šimkus, M. (2023). Circumscription in DL-Lite: Progress Report. In O. Kutz, C. Lutz, & A. Ozaki (Eds.), Proceedings of the 36th International Workshop on Description Logics (DL 2023) co-located with the 20th International Conference on Principles of Knowledge Representation and Reasoning (KR 2023). CEUR-WS.org. https://doi.org/10.34726/5328
E192-02 - Forschungsbereich Databases and Artificial Intelligence
-
Published in:
Proceedings of the 36th International Workshop on Description Logics (DL 2023) co-located with the 20th International Conference on Principles of Knowledge Representation and Reasoning (KR 2023)
-
Volume:
3515
-
Date (published):
23-Oct-2023
-
Event name:
36th International Workshop on Description Logics (DL 2023)
Circumscription is a prominent approach to bring non-monotonicity to Description Logics (DLs), but unfortunately, it usually displays very high computational complexity of reasoning. Many works have studied circumscribed DLs, but most of them focus on expressive DLs containing ALC, and the results for low-complexity DLs are limited. This paper summarises some recent progress in characterizing the computational complexity of reasoning in circumscribed DL-Lite. We perform a two-dimensional analysis, considering different languages of the DL-Lite family, and varying how concepts and roles are treated. In addition to classical circumscription, we consider the recently studied pointwise circumscription, which shows better complexity, in some cases, and remains decidable in the presence of minimized roles.
en
Project title:
Compiling Knowledge into Applications: P30873-N35 (FWF - Österr. Wissenschaftsfonds) Ontology-mediated Queries for Graph Databases: P 30360-N35 (FWF - Österr. Wissenschaftsfonds)
-
Project (external):
Knut and Alice Wallenberg Foundation
-
Project ID:
Wallenberg AI, Autonomous Systems and Software Program (WASP)
CC BY 4.0
