An abductive framework for computing knowledge base updates
Theory and Practice of Logic Programming
The Description Logic Handbook
The Description Logic Handbook
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
Journal of Automated Reasoning
Combining answer set programming with description logics for the Semantic Web
Artificial Intelligence
Exploiting conjunctive queries in description logic programs
Annals of Mathematics and Artificial Intelligence
A uniform integration of higher-order reasoning and external evaluations in answer-set programming
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Reconciling description logics and rules
Journal of the ACM (JACM)
Loop formulas for description logic programs
Theory and Practice of Logic Programming
Inconsistency-tolerant semantics for description logics
RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
A Novel Combination of Answer Set Programming with Description Logics for the Semantic Web
IEEE Transactions on Knowledge and Data Engineering
Dealing with inconsistency when combining ontologies and rules using DL-Programs
ESWC'10 Proceedings of the 7th international conference on The Semantic Web: research and Applications - Volume Part I
Well-supported semantics for description logic programs
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Database Repairing and Consistent Query Answering
Database Repairing and Consistent Query Answering
Exploiting unfounded sets for HEX-Program evaluation
JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
| Hi-index | 0.00 |
Nonmonotonic Description Logic (DL) programs support rule-based reasoning on top of Description Logic ontologies, using a well-defined query interface. However, the interaction of the rules and the ontology may cause inconsistency such that no answer set (i.e. model) exists. We thus consider repairing DL-programs, i.e., changing formulas to obtain consistency. Viewing the data part of the ontology as the source of inconsistency, we define program repairs and repair answer sets based on changes to it. We analyze the complexity of the notion, and we extend an algorithm for evaluating DL-programs to compute repair answer sets, under optional selection of preferred repairs. The extension involves a generalized ontology repair problem, in which the entailment and non-entailment of sets of queries with updates to the ontology must be achieved. While this is intractable in general, we identify for the Description Logic DL-LiteA some tractable classes of preferred repairs that are useful in practice.