%0 Conference Paper %1 heymans-ecai2010 %A Heymans, Stijn %A Eiter, Thomas %A Xiao, Guohui %B Proc. of 19th European Conference on Artificial Intelligence (ECAI) %D 2010 %E Coelho, Helder %E Studer, Rudi %E Wooldridge, Michael %I IOS Press %K 2010 myown ontorule refereedpub wp3 %P 35--40 %T Tractable Reasoning with DL-Programs over Datalog-rewritable Description Logics %U http://stijnheymans.net/pubs/ecai2010.pdf %V 215 %X 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.

@inproceedings{heymans-ecai2010, 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.}, added-at = {2010-11-23T16:33:32.000+0100}, author = {Heymans, Stijn and Eiter, Thomas and Xiao, Guohui}, biburl = {https://www.bibsonomy.org/bibtex/2bfeb3bb9e003d78f06e183d87ba86391/stijn.heymans}, booktitle = {Proc. of 19th European Conference on Artificial Intelligence (ECAI)}, editor = {Coelho, Helder and Studer, Rudi and Wooldridge, Michael}, interhash = {fcfd43ae6b90d6baa505a97ede8c24b1}, intrahash = {bfeb3bb9e003d78f06e183d87ba86391}, keywords = {2010 myown ontorule refereedpub wp3}, pages = {35--40}, publisher = {IOS Press}, series = {Frontiers in Artificial Intelligence and Applications}, timestamp = {2010-11-23T16:33:32.000+0100}, title = {Tractable Reasoning with DL-Programs over Datalog-rewritable Description Logics}, url = {http://stijnheymans.net/pubs/ecai2010.pdf}, volume = 215, year = 2010 }