Stijn Heymans, Livia Predoiu, Cristina Feier, Jos de Bruijn, and Davy Van Nieuwenborgh. G-hybrid knowledge bases. In Proceedings of the ICLP'06 Workshop on Applications of Logic Programming in the Semantic Web and Semantic Web Services (ALPSWS2006), volume 196, pages 39-54, Seattle, Washington, USA, August 16 2006. CEUR Workshop Proceedings.

Recently, there has been a lot of interest in the integration of Description Logics and rules on the Semantic Web. We define g-hybrid knowledge bases as knowledge bases that consist of a Description Logic knowledge base and a guarded logic program, similarly to the DL+log knowledge bases from Rosati. G-hybrid knowledge bases enable an integration of Description Logics and Logic Programming where, unlike in other approaches, variables in the rules of a guarded program do not need to appear in positive non-DL atoms of the body: DL atoms can act as guards as well. Decidability of satisfiability checking of g-hybrid knowledge bases is shown for the particular DL DLRO^-{<=}, which is close to, and in some respects more expressive than, OWL DL, by a reduction to guarded programs under an open answer set semantics. Moreover, we show 2-EXPTIME-completeness for satisfiability checking of those DLRO^-{<=} g-hybrid knowledge bases. Finally, we discuss advantages and disadvantages of our approach compared with DL+log knowledge bases.

[ bib | .pdf ] Back