Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
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
Extending and implementing the stable model semantics
Artificial Intelligence
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
Credulous resolution for answer set programming
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Clasp: a conflict-driven answer set solver
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Logic programs with abstract constraint atoms: the role of computations
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Integrating answer set reasoning with constraint solving techniques
FLOPS'08 Proceedings of the 9th international conference on Functional and 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
SMODELSA: a system for computing answer sets of logic programs with aggregates
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Present and Future Challenges for ASP Systems
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Monadic datalog over finite structures of bounded treewidth
ACM Transactions on Computational Logic (TOCL)
A translational approach to constraint answer set solving
Theory and Practice of Logic Programming
A 25-year perspective on logic programming
Compiling answer set programs into event-driven action rules
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Consistency and provenance in rule processing
RuleML'11 Proceedings of the 5th international conference on Rule-based modeling and computing on the semantic web
Answer set modules for logical agents
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Weighted-Sequence problem: ASP vs CASP and declarative vs problem-oriented solving
PADL'12 Proceedings of the 14th international conference on Practical Aspects of Declarative Languages
Translation-based constraint answer set solving
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Asp modulo csp: The clingcon system
Theory and Practice of Logic Programming
Inductive definitions in constraint programming
ACSC '13 Proceedings of the Thirty-Sixth Australasian Computer Science Conference - Volume 135
| Hi-index | 0.00 |
The paper describes a novel methodology to compute stable models in Answer Set Programming. The proposed approach relies on a bottom-up computation that does not require a preliminary grounding phase. The implementation of the framework can be completely realized within the framework of Constraint Logic Programming over finite domains. The use of a high level language for the implementation and the clean structure of the computation offer an ideal framework for the implementation of extensions of Answer Set Programming. In this work, we demonstrate how non-ground arithmetic constraints can be easily introduced in the computation model. The paper provides preliminary experimental results which confirm the potential for this approach.