Paper Info
Title
An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems
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.
Year
DOI
Venue
2009
10.1080/09528130701538174
J. Exp. Theor. Artif. Intell.
Keywords
Field
DocType
various computationally hard problem,finite domains,programming solution,constraint logic programming,experimental comparison,answer set programming,different problem,empirical study,combinatorial problem,declarative encodings,logic programming
Functional logic programming,Constraint satisfaction,Computer science,Constraint programming,Inductive programming,Theoretical computer science,Concurrent constraint logic programming,Logic programming,Constraint logic programming,Answer set programming
Journal
Volume
Issue
ISSN
21
2
0952-813X
Citations 
PageRank 
References 
21
0.80
26
Authors
3
Name
Order
Citations
PageRank
Agostino Dovier197281.11
Andrea Formisano230132.94
Enrico Pontelli31901181.26