Sciweavers

Share
ASP
2005
Springer

Extending Conceptual Logic Programs with Arbitrary Rules

9 years 3 months ago
Extending Conceptual Logic Programs with Arbitrary Rules
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 with both ontological and rule-based knowledge, which is illustrated by simulating reasoning in an expressive description logic (DL) equipped with DL-safe rules. Furthermore, ECLPs are more expressive in the sense that they enable nonmonotonic reasoning, a desirable feature in locally closed subareas of the Semantic Web.
Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir
Added 26 Jun 2010
Updated 26 Jun 2010
Type Conference
Year 2005
Where ASP
Authors Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir
Comments (0)
books