The well-founded semantics for general logic programs
Journal of the ACM (JACM)
A minimal extension of the WAM for clp(FD)
ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
Answer Set Planning (Abstract)
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Improving the Alternating Fixpoint: The Transformation Approach
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
ASSAT: computing answer sets of a logic program by SAT solvers
Artificial Intelligence - Special issue on nonmonotonic reasoning
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
Inferring Phylogenetic Trees Using Answer Set Programming
Journal of Automated Reasoning
Integrating answer set programming and constraint logic programming
Annals of Mathematics and Artificial Intelligence
Credulous resolution for answer set programming
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
The FF planning system: fast plan generation through heuristic search
Journal of Artificial Intelligence Research
Clasp: a conflict-driven answer set solver
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Multivalued action languages with constraints in CLP(FD)
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Logic programs with abstract constraint atoms: the role of computations
ICLP'07 Proceedings of the 23rd international conference on Logic programming
A comparison of CLP(FD) and ASP solutions to NP-Complete problems
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Hi-index | 0.00 |
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.