An experimental comparison of constraint logic programming and answer set programming

Authors:
Agostino Dovier;Andrea Formisano;Enrico Pontelli
Affiliations:
Università di Udine, Dip. di Matematica e Informatica;Università di Perugia, Dip. di Matematica e Informatica;New Mexico State University, Dept. of Computer Science
Venue:
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Year:
2007

Citing 9
Cited 4

Autoepistemic logic

Journal of the ACM (JACM)
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
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
Why are there so many loop formulas?

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

Journal of Automated Reasoning
A comparison of CLP(FD) and ASP solutions to NP-Complete problems

ICLP'05 Proceedings of the 21st international conference on Logic Programming

Integrating answer set programming and constraint logic programming

Annals of Mathematics and Artificial Intelligence
Towards an Embedded Approach to Declarative Problem Solving in ASP

LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
An overview of AI research in Italy

Artificial intelligence
Perspectives on logic-based approaches for reasoning about actions and change

Logic programming, knowledge representation, and nonmonotonic reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

Answer Set Programming (ASP) and Constraint Logic Programming over finite domains (CLP(FD)) are two declarative progmmming paradigms that have been extensively used to encode applications involving search, optimization, and reasoning (e.g., commonsense reasoning and planning). This paper presents experimental comparisons between the declarative encodings of various computationally hard problems in both frameworks. The objective is to investigate 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 over the other. Ultimately, the work in this paper is expected to lay the foundations for transfer of technology between the two domains, e.g., suggesting ways to use CLP(FD) in the execution of ASP.