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. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Heymans, S., Van Nieuwenborgh, D., & Vermeir, D. (2005). Nonmonotonic ontological and rule-based reasoning with extended conceptual logic programs. In Lecture Notes in Computer Science (Vol. 3532, pp. 392–407). Springer Verlag. https://doi.org/10.1007/11431053_27
Mendeley helps you to discover research relevant for your work.