Data repair of inconsistent nonmonotonic description logic programs

DOI10.1016/j.artint.2016.06.003zbMath1386.68157OpenAlexW2442124702MaRDI QIDQ322065

Michael Fink, Thomas Eiter, Daria Stepanova

Publication date: 14 October 2016

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2016.06.003

zbMATH Keywords

rulesnonmonotonic reasoningdescription logicsinconsistency managementanswer set programmingontologies

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30) Logic programming (68N17)

Uses Software

• ELK
• owlcpp

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A non-monotonic description logic for reasoning about typicality
• Prioritized repairing and consistent query answering in relational databases
• A formal framework for the study of the notion of undefined particle number in quantum mechanics
• Local closed world reasoning with description logics under the well-founded semantics
• A theory of diagnosis from first principles
• An epistemic operator for description logics
• Incoherency problems in a combination of description logics and rules
• The incredible ELK. From polynomial procedures to efficient reasoning with \(\mathcal {EL}\) ontologies
• Policy-based inconsistency management in relational databases
• Advanced methods for inconsistent knowledge management. With a foreword by Lakmi C. Jain
• Combining answer set programming with description logics for the semantic web
• Tractable reasoning and efficient query answering in description logics: The DL-Lite family
• Reasoning about Explanations for Negative Query Answers in DL-Lite
• Stepwise Debugging of Description-Logic Programs
• Computing Repairs for Inconsistent DL-programs over $\mathcal{EL}$ Ontologies
• Well-founded semantics for description logic programs in the semantic web
• Reconciling description logics and rules
• Loop formulas for description logic programs
• The Complexity of Circumscription in DLs
• Runtime Verification Using a Temporal Description Logic
• On the logic of theory change: Partial meet contraction and revision functions
• Autoepistemic logic
• An abductive framework for computing knowledge base updates
• Paraconsistent Stable Semantics for Extended Disjunctive Programs
• A General Framework for Reasoning On Inconsistency
• Reasoning with inconsistencies in hybrid MKNF knowledge bases
• Rational Closure for Defeasible Description Logics
• Efficient HEX-Program Evaluation Based on Unfounded Sets
• Linking Data to Ontologies
• Inconsistency Tolerance
• Description logics of minimal knowledge and negation as failure

This page was built for publication: Data repair of inconsistent nonmonotonic description logic programs