Guarded Hybrid Knowledge Bases

Simple item page
dc.creatorHeymans, Stijn
dc.creatorde Bruijn, Jos
dc.creatorPredoiu, Livia
dc.creatorFeier, Cristina
dc.creatorVan Nieuwenborgh, Davy
dc.date2007-11-14
dc.date.accessioned2026-07-07T08:42:54Z
dc.date.available2026-07-07T08:42:54Z
dc.descriptionRecently, 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.
dc.description18 pages
dc.identifierhttps://arxiv.org/abs/0711.2155
dc.identifierhttp://arxiv.org/abs/0711.2155
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/142128
dc.subjectLogic in Computer Science
dc.subjectI.2.3; I.2.4
dc.titleGuarded Hybrid Knowledge Bases
dc.typetext

Files

Collections

arXiv