Sciweavers

Share
ECAI
2010
Springer

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

8 years 8 months ago
Tractable Reasoning with DL-Programs over Datalog-rewritable Description Logics
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
Stijn Heymans, Thomas Eiter, Guohui Xiao
Added 08 Nov 2010
Updated 08 Nov 2010
Type Conference
Year 2010
Where ECAI
Authors Stijn Heymans, Thomas Eiter, Guohui Xiao
Comments (0)
books