# Guarded hybrid knowledge bases12

@article{Heymans2008GuardedHK,
title={Guarded hybrid knowledge bases12},
author={Stijn Heymans and Jos de Bruijn and Livia Predoiu and Cristina Feier and Davy Van Nieuwenborgh},
journal={Theory and Practice of Logic Programming},
year={2008},
volume={8},
pages={411 - 429}
}
• Published 14 November 2007
• Computer Science
• Theory and Practice of Logic Programming
Abstract Recently, there has been a lot of interest in the integration of Description Logics (DL) 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 $\mathcal{DL}$ + log knowledge bases from Rosati (In Proceedings of the 10th International Conference on Principles of Knowledge Representation and Reasoning, AAAI Press, Menlo Park, CA…
Reasoning with Forest Logic Programs and f-hybrid knowledge bases*†
• Computer Science
Theory and Practice of Logic Programming
• 2011
This paper provides a sound, complete, and terminating algorithm for satisfiability checking w.r.t. Forest Logic Programs (FoLPs), a fragment of OASP where rules have a tree shape and allow for inequality atoms and constants, and introduces f-hybrid knowledge bases, a hybrid framework where knowledge bases and FoLPs coexist, and shows that reasoning with such knowledge bases can be reduced to reasoning with FoLLP only.
Hybrid Reasoning with Forest Logic Programs
• Computer Science
ESWC
• 2009
This paper provides a sound, complete, and terminating algorithm for satisfiability checking w.r.t. forest logic programs, a fragment where rules have a tree shape and allow for inequality atoms and constants, and introduces f-hybrid knowledge bases, a hybrid framework where $\mathcal SHOQ$ knowledge bases and forest Logic programs co-exist.
Iterated Fixpoint Well-Founded Semantics for Hybrid Knowledge Bases
• Computer Science
ICTCS/CILC
• 2017
The results show that overall HKBs seem to be those that more tightly integrate LP and DL, even if there exist incomparable languages such as the recent FO(ID) formalism.
A Reasoner for Simple Conceptual Logic Programs
• Computer Science
RR
• 2009
This paper describes an algorithm for satisfiability checking of the fragment of simple Conceptual Logic Programs and provides a BProlog implementation, believed to be the first implementation of a fragment of a framework that can tightly integrate ontologies and non-DL-safe rules under an expressive nonmonotonic semantics.
Hybrid Reasoning with Rules and Ontologies
• Computer Science
REWERSE
• 2009
This chapter is to report on work that has been done in the REWERSE project concerning hybrid reasoning with rules and ontologies, and variants and derivations of the formalisms have been conceived.
On Combining Description Logic Ontologies and Nonrecursive Datalog Rules
This paper provides a set of decidability and complexity results for reasoning in systems combining ontologies specified in DLs and rules specified in nonrecursive Datalog (and its extensions with inequality and negation): such results identify, from the viewpoint of the expressive abilities of the two formalisms, minimal combinations of Description Logics andDatalog in which reasoning is undecidable.
Bridging the gap between classical logic based formalisms and logic programs
• Computer Science
• 2012
The integration of DLs and ASP presented in this dissertation provides a framework for integrating rules and ontologies for the semantic web, which enables us to perform nonmonotonic reasoning with DL knowledge bases.
SIMPLE CONCEPTUAL LOGIC PROGRAMS
An algorithm is provided that checks NEXPTIME for the fragment of EXPTIME-completesimple conceptual logic programs that allows for a tight integration of Logic Programming rules and D escription Logic ontologies.
Extending Logic Programs with Description Logic Expressions for the Semantic Web
• Computer Science, Philosophy
SEMWEB
• 2011
This paper proposes a new extension of logic programs with DL expressions, called normal DL logic programs, and defines an answer set semantics forDL logic programs which satisfies the extended well-supportedness condition.
FO(ID) as an extension of DL with rules
• Computer Science
Annals of Mathematics and Artificial Intelligence
• 2010
This paper investigates the integration of first-order logic and Logic Programs and discovers whether there are interesting extensions of DL with rules that can be arrived at by imposing appropriate restrictions on the highly expressive FO(ID).

## References

SHOWING 1-10 OF 36 REFERENCES
DL+log: Tight Integration of Description Logics and Disjunctive Datalog
DL +log is defined, a general framework for the integration of Description Logics and disjunctive Datalog rules that allows for a tighter form of integration between DL-KBs and Datalogs rules which overcomes the main representational limits of the approaches based on the safety condition.
Reasoning with the Description Logic DLRO ¡fg using Bound Guarded Programs
• Computer Science
• 2006
It is shown how bound guarded programs are expressive enough to simulate satisability checking in a DL with n-ary roles and nominals, yielding EXP- TIME-completeness for both the DL reasoning and the reasoning with bound guarded Programs under the open answer set seman- tics.
Semantic and Computational Advantages of the Safe Integration of Ontologies and Rules
This paper defines safe hybrid knowledge bases, a general formal framework for integrating ontologies and rules, which provides for a clear treatment of semantic issues and presents a reasoning algorithm and establishes general decidability and complexity results for reasoning in safe hybrid KBs.
Conceptual logic programs
• Computer Science
Annals of Mathematics and Artificial Intelligence
• 2006
CoLPs integrate, in one unifying framework, the best of both the logic programming paradigm (a flexible rule-based representation and nonmonotonicity by means of negation as failure) and the description logics paradigm (decidable open domain reasoning).
Reducing SHIQ-Description Logic to Disjunctive Datalog Programs
• Computer Science
KR
• 2004
This paper presents a novel approach to checking consistency of ABoxes, instance checking and query answering, w.r.t. optimization techniques from deductive databases, and a resolution-based decision procedure for unary coding of numbers worst-case optimal.
A Faithful Integration of Description Logics with Logic Programming
• Computer Science
IJCAI
• 2007
This paper introduces hybrid MKNF knowledge bases that faithfully integrate DLs with LP using the logic of Minimal Knowledge and Negation as Failure (MKNF) [Lifschitz, 1991].
The Description Logic Handbook
• Computer Science
• 2007
This introduction presents the main motivations for the development of Description Logics (DLs) as a formalism for representing knowledge, as well as some important basic notions underlying all
It turns out that the communication strategy makes the system quite expressive: essentially a sequence of a fixed number of programs n captures the complexity class ${\ensuremath{\Sigma}^P_n}$, i.e. the n-th level of the polynomial hierarchy.