Journal of the ACM (JACM)
On the complexity of protein folding (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Answer Set Planning (Abstract)
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
ASSAT: computing answer sets of a logic program by SAT solvers
Eighteenth national conference on Artificial intelligence
Theory and Practice of Logic Programming
SAT-based answer set programming
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Comparative uncertainty: Theory and automation
Mathematical Structures in Computer Science
Dynamic scheduling in parallel answer set programming solvers
SpringSim '07 Proceedings of the 2007 spring simulation multiconference - Volume 2
Compiling and Executing Declarative Modeling Languages to Gecode
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Evaluating ASP and commercial solvers on the CSPLib
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Answer Set Programming with Constraints Using Lazy Grounding
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Logic Programming Techniques in Protein Structure Determination: Methodologies and Results
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
An experimental comparison of constraint logic programming and answer set programming
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
GASP: Answer Set Programming with Lazy Grounding
Fundamenta Informaticae - Advances in Computational Logic (CIL C08)
CPP: a constraint logic programming based planner with preferences
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
A translational approach to constraint answer set solving
Theory and Practice of Logic Programming
Perspectives on logic-based approaches for reasoning about actions and change
Logic programming, knowledge representation, and nonmonotonic reasoning
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
GASP: Answer Set Programming with Lazy Grounding
Fundamenta Informaticae - Advances in Computational Logic (CIL C08)
Nested Weight Constraints in ASP
Fundamenta Informaticae - Special Issue on the Italian Conference on Computational Logic: CILC 2011
Hi-index | 0.00 |
This paper presents experimental comparisons between declarative encodings of various computationally hard problems in both Answer Set Programming (ASP) and Constraint Logic Programming (CLP) over finite domains. The objective is to identify how the solvers in the two domains respond to different problems, highlighting strengths and weaknesses of their implementations and suggesting criteria for choosing one approach versus the other. Ultimately, the work in this paper is expected to lay the ground for transfer of concepts between the two domains (e.g., suggesting ways to use CLP in the execution of ASP).