The Complexity of Circumscription in DLs
From MaRDI portal
Publication:3651476
DOI10.1613/jair.2763zbMath1182.68275arXiv1401.3476OpenAlexW3105235590MaRDI QIDQ3651476
Frank Wolter, Carsten Lutz, Piero A. Bonatti
Publication date: 10 December 2009
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.3476
Related Items
Query answering in circumscribed OWL2 profiles, A note on a description logic of concept and role typicality for defeasible reasoning over ontologies, Making the right exceptions, On the KLM properties of a fuzzy DL with typicality, Data repair of inconsistent nonmonotonic description logic programs, On the logical properties of the nonmonotonic description logic \(\mathcal{DL}^{\operatorname{N}}\), The Distributed Ontology, Modeling and Specification Language – DOL, ASP for minimal entailment in a rational extension of SROEL, Semantic characterization of rational closure: from propositional logic to description logics, On combining ontologies and rules, A polynomial time subsumption algorithm for nominal safe \(\mathcal{ELO}_\bot\) under rational closure, An ASP approach for reasoning in a concept-aware multipreferential lightweight DL, Formalizing GDPR provisions in reified I/O logic: the DAPRECO knowledge base, Decidability of Circumscribed Description Logics Revisited, Contextual rational closure for defeasible \(\mathcal{ALC} \), A Tableau Calculus for Minimal Modal Model Generation, Introducing Role Defeasibility in Description Logics, Reasoning about Exceptions in Ontologies: from the Lexicographic Closure to the Skeptical Closure, Rational closure for all description logics, Typicalities and probabilities of exceptions in nonmotonic description logics, Revisiting Grounded Circumscription in Description Logics
