Description logic programs: combining logic programs with description logic
WWW '03 Proceedings of the 12th international conference on World Wide Web
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
Deciding expressive description logics in the framework of resolution
Information and Computation
Combining a DL Reasoner and a Rule Engine for Improving Entailment-Based OWL Reasoning
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
Implementing an Inference Engine for RDFS/OWL Constructs and User-Defined Rules in Oracle
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Approximating OWL-DL ontologies
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
LUBM: A benchmark for OWL knowledge base systems
Web Semantics: Science, Services and Agents on the World Wide Web
Expressive approximations in DL-lite ontologies
AIMSA'10 Proceedings of the 14th international conference on Artificial intelligence: methodology, systems, and applications
Completeness guarantees for incomplete reasoners
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
Towards a complete OWL ontology benchmark
ESWC'06 Proceedings of the 3rd European conference on The Semantic Web: research and applications
OWLIM – a pragmatic semantic repository for OWL
WISE'05 Proceedings of the 2005 international conference on Web Information Systems Engineering
Query rewriting under ontology contraction
RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
Query rewriting under query refinements
Knowledge-Based Systems
| Hi-index | 0.00 |
The need for scalable query answering often forces Semantic Web applications to use incomplete OWL 2 reasoners, which in some cases fail to derive all answers to a query. This is clearly undesirable, and in some applications may even be unacceptable. To address this problem, we investigate the problem of 'repairing' an ontology τ --that is, computing an ontology R such that a reasoner that is incomplete for τ becomes complete when used with τ ∪ R. We identify conditions on τ and the reasoner that make this possible, present a practical algorithm for computing R, and present a preliminary evaluation which shows that, in some realistic cases, repairs are feasible to compute, reasonable in size, and do not significantly affect reasoner performance.