An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems

Authors:
Agostino Dovier;Andrea Formisano;Enrico Pontelli
Affiliations:
Dipartimento di Matematica e Informatica, Universita di Udine, 33100 Udine, Italy;Dipartimento di Matematica e Informatica, Universita di Perugia, 06123 Perugia, Italy;Department of Computer Science, New Mexico State University, Las Cruces, NM 88003-8001, USA
Venue:
Journal of Experimental & Theoretical Artificial Intelligence
Year:
2009

Citing 15
Cited 8

Autoepistemic logic

Journal of the ACM (JACM)
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
Answer set planning

Proceedings of the 1999 international conference on Logic programming
A machine program for theorem-proving

Communications of the ACM
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Knowledge Representation, Reasoning, and Declarative Problem Solving

Knowledge Representation, Reasoning, and Declarative Problem Solving
A Comparative Study of Eight Constraint Programming LanguagesOver the Boolean and Finite Domains

Constraints
Reasoning about Actions with CHRs and Finite Domain Constraints

ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Representing Knowledge in A-Prolog

Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
ASSAT: computing answer sets of a logic program by SAT solvers

Eighteenth national conference on Artificial intelligence
On Benchmarking Constraint Logic Programming Platforms. Response to Fernandez and Hill's “A Comparative Study of Eight Constraint Programming Languages over the Boolean and Finite Domains”

Constraints
Tight logic programs

Theory and Practice of Logic Programming
Why are there so many loop formulas?

ACM Transactions on Computational Logic (TOCL)
Answer Set Programming Based on Propositional Satisfiability

Journal of Automated Reasoning
SAT-based answer set programming

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence

Present and Future Challenges for ASP Systems

LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Constraint logic programming

A 25-year perspective on logic programming
Answer set programming

A 25-year perspective on logic programming
Perspectives on logic-based approaches for reasoning about actions and change

Logic programming, knowledge representation, and nonmonotonic reasoning
Weight constraint programs with evaluable functions

Annals of Mathematics and Artificial Intelligence
Generation of test data structures using constraint logic programming

TAP'12 Proceedings of the 6th international conference on Tests and Proofs
Nested Weight Constraints in ASP

Fundamenta Informaticae - Special Issue on the Italian Conference on Computational Logic: CILC 2011
A Tabled Prolog Program for Solving Sokoban

Fundamenta Informaticae - Special Issue on the Italian Conference on Computational Logic: CILC 2011

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents experimental comparisons between the declarative encodings of various computationally hard problems in Answer Set Programming (ASP) and Constraint Logic Programming over Finite Domains (CLP(FD)). The objective is to investigate how solvers in the two domains respond to different problems, highlighting the strengths and weaknesses of their implementations, and suggesting criteria for choosing one approach over the other. Ultimately, the work in this paper is expected to lay the foundations for a transfer of technology between the two domains, for example by suggesting ways to use CLP(FD) in the execution of ASP.