Description logics of minimal knowledge and negation as failure
From MaRDI portal
Publication:5738954
DOI10.1145/505372.505373zbMath1365.68403OpenAlexW2059360847WikidataQ58006964 ScholiaQ58006964MaRDI QIDQ5738954
Daniele Nardi, Francesco M. Donini, Riccardo Rosati
Publication date: 13 June 2017
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/505372.505373
Related Items (26)
Query answering in circumscribed OWL2 profiles ⋮ Linking Open-World Knowledge Bases Using Nonmonotonic Rules ⋮ Doctoral Consortium Extended Abstract: Default Mappings in Ontology-Based Data Access ⋮ A note on a description logic of concept and role typicality for defeasible reasoning over ontologies ⋮ Reasoning with Forest Logic Programs and f-hybrid knowledge bases ⋮ Data repair of inconsistent nonmonotonic description logic programs ⋮ Combining answer set programming with description logics for the semantic web ⋮ PS\textsc{pace} tableau algorithms for acyclic modalized \({\mathcal{ALC}}\) ⋮ Unnamed Item ⋮ On the logical properties of the nonmonotonic description logic \(\mathcal{DL}^{\operatorname{N}}\) ⋮ Integrity constraints in OWL ontologies based on grounded circumscription ⋮ ASP for minimal entailment in a rational extension of SROEL ⋮ Defeasible inheritance with doubt index and its axiomatic characterization ⋮ Semantic characterization of rational closure: from propositional logic to description logics ⋮ On combining ontologies and rules ⋮ Local closed world reasoning with description logics under the well-founded semantics ⋮ 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 ⋮ A Tableau Calculus for a Nonmonotonic Extension of $\mathcal{EL}^\bot$ ⋮ Decidability of Circumscribed Description Logics Revisited ⋮ Realizing Default Logic over Description Logic Knowledge Bases ⋮ 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 ⋮ Optimizing the computation of overriding in \(\mathcal{DL}^{\mathsf{N}}\) ⋮ Typicalities and probabilities of exceptions in nonmotonic description logics
This page was built for publication: Description logics of minimal knowledge and negation as failure
