Circumscription and logic programs under the stable model semantics are two wellknown nonmonotonic formalisms. The former has served as a basis of classical logic based action for...
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...
Stijn Heymans, Jos de Bruijn, Livia Predoiu, Crist...
We present extended conceptual logic programs (ECLPs), for which reasoning is decidable and, moreover, can be reduced to finite answer set programming. ECLPs are useful to reason ...
Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir
We present extended conceptual logic programs (ECLPs), for which reasoning is decidable and, moreover, can be reduced to finite answer set programming. ECLPs are useful to reason ...
Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir
In recent research on nonmonotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P ∪ R and Q ∪ R h...