2007/11/14 by Stijn Heymans, Jos de Bruijn, Heymans, Stijn +7
Computer Science · #AI-based Problem Solving and Planning #FOS: Computer and information sciences #I.2.3 #I.2.4 #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Semantic Web and Ontologies #cs.LO
paper · pdf · doi:10.48550/arxiv.0711.2155
18 pages
arxiv created 2007/11/14 · openalex publication_date 2007/11/14 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Recently, there has been a lot of interest in the integration of Description Logics and rules on the Semantic Web.We define guarded hybrid knowledge bases (or g-hybrid knowledge bases) as knowledge bases that consist of a Description Logic knowledge base and a guarded logic program, similar to the DL+log knowledge bases from (Rosati 2006). 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 as guards as well. Decidability of satisfiability checking of g-hybrid knowledge bases is shown for the particular DL DLRO, 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 DL+log knowledge bases.