Author:
Bonatti P. A.,Lutz C.,Wolter F.
Abstract
As fragments of first-order logic, Description logics (DLs) do not provide nonmonotonic features such as defeasible inheritance and default rules. Since many applications would benefit from the availability of such features, several families of nonmonotonic DLs have been developed that are mostly based on default logic and autoepistemic logic. In this paper, we consider circumscription as an interesting alternative approach to nonmonotonic DLs that, in particular, supports defeasible inheritance in a natural way. We study DLs extended with circumscription under different language restrictions and under different constraints on the sets of minimized, fixed, and varying predicates, and pinpoint the exact computational complexity of reasoning for DLs ranging from ALC to ALCIO and ALCQO. When the minimized and fixed predicates include only concept names but no role names, then reasoning is complete for NExpTime^NP. It becomes complete for NP^NExpTime when the number of minimized and fixed predicates is bounded by a constant. If roles can be minimized or fixed, then complexity ranges from NExpTime^NP to undecidability.
Cited by
63 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. A preferential interpretation of MultiLayer Perceptrons in a conditional logic with typicality;International Journal of Approximate Reasoning;2024-01
2. A Defeasible Description Logic for Abduction;AIxIA 2023 – Advances in Artificial Intelligence;2023
3. On Combining Ontologies and Rules;Reasoning Web. Declarative Artificial Intelligence;2022
4. Query answering in circumscribed OWL2 profiles;Annals of Mathematics and Artificial Intelligence;2021-08-31
5. Principles of KLM-style Defeasible Description Logics;ACM Transactions on Computational Logic;2021-01-31