DReW: a Reasoner for Datalog-rewritable Description Logics and DL-Programs
Guohui Xiao, Stijn Heymans, Thomas Eiter · 2010
Abstract. Nonmonotonic dl-programs provide a loose integration of Description Logic (DL) ontologies and Logic Programming (LP) rules with negation, where a rule engine can query an ontology with a native DL reasoner. However, even for tractable dl-programs, the overhead of an external DL reasoner might be considerable. Datalog-rewritable DL ontologies, such as LDL +, can be rewritten to Datalog programs, such that dl-programs can be reduced to Datalog ¬ , i.e, Datalog with negation, under well-founded semantics. We developed the reasoner DReW that uses the Datalog-rewriting technique. DReW can as such answer conjunctive queries over LDL + ontologies, as well as reason on dlprograms over LDL + ontologies under well-founded semantics. The preliminary but encouraging experimental results show that DReW can efficiently handle large knowledge bases. 1