Guarded hybrid knowledge bases

Abstract

AbstractRecently, there has been a lot of interest in the integration of Description Logics (DL) and rules on the Semantic Web. We defineguarded hybrid knowledge bases(org-hybrid knowledge bases) as knowledge bases that consist of a Description Logic knowledge base and aguardedlogic program, similar to the$\mathcal{DL}$+logknowledge bases from Rosati (In Proceedings of the 10th International Conference on Principles of Knowledge Representation and Reasoning, AAAI Press, Menlo Park, CA, 2006, pp. 68–78.). 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, i.e., DL atoms can act asguardsas well. Decidability of satisfiability checking of g-hybrid knowledge bases is shown for the particular DL$\mathcal{DLRO}^{\-{le}}$, which is close to OWL DL, by a reduction to guarded programs under the open answer set semantics. Moreover, we show 2-Exptime-completeness for satisfiability checking of such g-hybrid knowledge bases. Finally, we discuss advantages and disadvantages of our approach compared with$\mathcal{DL}$+logknowledge bases.