Name
Abstract | ||
|---|---|---|
We present extended conceptual logic programs (ECLPs) , for which reasoning is decidable and, moreover, can be reduced to finit e answer set pro- gramming. ECLPs are useful to reason with both ontological and rule-based knowledge, which is illustrated by simulating reasoning in an expressive descrip- tion logic (DL) equipped with DL-safe rules. Furthermore, ECLPs are more ex- pressive in the sense that they enable nonmonotonic reasoning, a desirable feature in locally closed subareas of the Semantic Web. |
Year | Venue | Keywords |
|---|---|---|
2005 | Answer Set Programming | rule based,nonmonotonic reasoning,semantic web |
Field | DocType | Citations |
Computational logic,Description logic,Decidability,Theoretical computer science,Non-monotonic logic,Stable model semantics,Semantic Web Rule Language,Answer set programming,Dynamic logic (modal logic),Mathematics | Conference | 1 |
PageRank | References | Authors |
0.37 | 13 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stijn Heymans | 1 | 463 | 37.60 |
| Davy Van Nieuwenborgh | 2 | 231 | 14.54 |
| Dirk Vermeir | 3 | 694 | 85.34 |