Name
Abstract | ||
|---|---|---|
In recent years, Answer Set Programming has gained popularity as a viable paradigm for applications in knowledge representation and reasoning. This paper presents a novel methodology to compute answer sets of an answer set program. The proposed methodology maintains a bottom-up approach to the computation of answer sets (as in existing systems), but it makes use of a novel structuring of the computation, that originates from the non-ground version of the program. Grounding is lazily performed during the computation of the answer sets. The implementation has been realized using Constraint Logic Programming over finite domains. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.3233/FI-2009-180 | Fundam. Inform. |
Keywords | Field | DocType |
finite domain,answer set program,answer set,novel methodology,proposed methodology,knowledge representation,novel structure,answer set programming,lazy grounding,bottom-up approach,constraint logic programming,bottom up,logic programming | Procedural programming,Functional logic programming,Constraint programming,Inductive programming,Theoretical computer science,Stable model semantics,Logic programming,Declarative programming,Answer set programming,Mathematics | Journal |
Volume | Issue | ISSN |
96 | 3 | 0169-2968 |
Citations | PageRank | References |
25 | 0.78 | 21 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alessandro Dal Palù | 1 | 211 | 14.97 |
| Agostino Dovier | 2 | 972 | 81.11 |
| Enrico Pontelli | 3 | 1901 | 181.26 |
| Gianfranco Rossi | 4 | 453 | 43.90 |