Name
Abstract | ||
|---|---|---|
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. |
Year | Venue | Keywords |
|---|---|---|
2013 | IJCAI | repair answer set,program repair,answer set,preferred repair,Nonmonotonic Description Logic,generalized ontology repair problem,Description Logic ontology,data part,repair answer,Description Logic DL-LiteA,inconsistent DL-programs |
Field | DocType | Citations |
Ontology (information science),Data mining,Ontology,Logical consequence,Process ontology,Data repair,Computer science,Description logic,Theoretical computer science,Artificial intelligence,Machine learning | Conference | 3 |
PageRank | References | Authors |
0.39 | 16 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Thomas Eiter | 1 | 7238 | 532.10 |
| Michael Fink | 2 | 1145 | 62.43 |
| Daria Stepanova | 3 | 46 | 12.10 |