Tractable Reasoning with DL-Programs over Datalog-rewritable Description Logics

  • Authors:

  • Stijn Heymans;Thomas Eiter;Guohui Xiao

  • Affiliations:

  • Knowledge Based Systems Group, Institute of Information Systems, Vienna University of Technology, Favoritenstraße 9-11, A-1040 Austria, email: {heymans,eiter,xiao}@kr.tuwien.ac.at;Knowledge Based Systems Group, Institute of Information Systems, Vienna University of Technology, Favoritenstraße 9-11, A-1040 Austria, email: {heymans,eiter,xiao}@kr.tuwien.ac.at;Knowledge Based Systems Group, Institute of Information Systems, Vienna University of Technology, Favoritenstraße 9-11, A-1040 Austria, email: {heymans,eiter,xiao}@kr.tuwien.ac.at

  • Venue:
  • Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

The deployment of KR formalisms to the Web has created the need for formalisms that combine heterogeneous knowledge bases. 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. To remedy this, we consider Datalog-rewritable DL ontologies, i.e., ones that can be rewritten to Datalog programs, such that dl-programs can be reduced to Datalog¬, i.e, Datalog with negation, under well-founded semantics. To illustrate this framework, we consider several Datalog-rewritable DLs. Besides fragments of the tractable OWL 2 Profiles, we also present LDL+ as an interesting DL that is tractable while it has some expressive constructs. Our results enable the usage of DBLP technology to reason efficiently with dl-programs in presence of negation and recursion, as a basis for advanced applications.