We propose a new technique for approximate ABox reasoning with OWL DL ontologies. Essentially, we obtain substantially improved reasoning performance by disregarding non-Horn features of OWL DL. Our approach comes as a side-product of recent research results concerning a new transformation of OWL DL ontologies into negation-free disjunctive datalog, and rests on the idea of performing standard resolution over disjunctive rules by treating them as if they were non-disjunctive ones. We analyse our reasoning approach by means of non-monotonic reasoning techniques, and present an implementation, called Screech.
@InProceedings{hitzler_et_al:DagSemProc.05371.5, author = {Hitzler, Pascal and Vrandecic, Denny}, title = {{Faster OWL Using Split Programs}}, booktitle = {Principles and Practices of Semantic Web Reasoning}, pages = {1--2}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {5371}, editor = {Fran\c{c}ois Bry and Fran\c{c}ois Fages and Massimo Marchiori and Hans-J\"{u}rgen Ohlbach}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05371.5}, URN = {urn:nbn:de:0030-drops-4803}, doi = {10.4230/DagSemProc.05371.5}, annote = {Keywords: OWL DL, Approximate Reasoning, Logic Programming} }
Feedback for Dagstuhl Publishing