Name
Abstract | ||
|---|---|---|
Open answer set programming (OASP) solves the lack of modularity in closed world answer set programming by allowing for the grounding of logic programs with an arbitrary non-empty countable superset of the program's constants. However, OASP is, in general, undecidable: the undecidable domino problem can be reduced to it. In order to regain decidability, we restrict the shape of logic programs, yielding conceptual logic programs (CoLPs). CoLPs are logic programs with unary and binary predicates (possibly inverted) where rules have a tree shape. Decidability of satisfiability checking of predicates w.r.t. CoLPs is shown by a reduction to non-emptiness checking of two-way alternating tree automata. We illustrate the expressiveness of CoLPs by simulating the description logic $\mathcal{SHIQ}$ . CoLPs thus 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). |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/s10472-006-9030-5 | Ann. Math. Artif. Intell. |
Keywords | DocType | Volume |
answer set programming,open domains,description logics,68T27,68T30,68N17 | Journal | 47 |
Issue | ISSN | Citations |
1-2 | 1012-2443 | 10 |
PageRank | References | Authors |
0.73 | 23 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stijn Heymans | 1 | 463 | 37.60 |
| Davy Van Nieuwenborgh | 2 | 231 | 14.54 |
| Dirk Vermeir | 3 | 694 | 85.34 |