[Zurück]

S. Heymans, T. Eiter, G. Xiao:
"Tractable Reasoning with DL-Programs over Datalog-rewritable Description Logics";
Vortrag: European Conference on Artificial Intelligence (ECAI), Lisbon, Portugal; 16.08.2010 - 20.08.2010; in: "19th European Conference on Artificial Intelligence (ECAI 2010)", H. Coelho, R. Studer, M. Wooldridge (Hrg.); IOS Press, 215 (2010), ISBN: 978-1-60750-605-8; S. 35 - 40.

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 on 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 ontologies Datalog DL rewritable ie, ones that can be rewritten to Datalog programs, seeking that dl-programs can be reduced to Datalog ¬ ie, datalog with negation, under well-founded semantics. To illustrate this framework, we consider several Datalog rewritable DL discs. Besides the tractable fragments of OWL 2 Profiles we, therefore, present an interesting LDL + as expressive DL that is tractable while it has some constructs. Our results enable the usage of technology to reason efficiently with DBLP dl-programs in presence of negation and recursion, as a basis for advanced applications.

http://dx.doi.org/10.3233/978-1-60750-606-5-35

http://publik.tuwien.ac.at/files/PubDat_190852.pdf

Projektleitung Thomas Eiter:
ONOTRULE - ONTOlogies meet business RULEs

Projektleitung Thomas Eiter:
Schließen in hybriden Wissensbasen