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.
No Reference information available - sign in for access.
No Citation information available - sign in for access.
No Supplementary Data.
No Article Media
Document Type: Research Article
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
Publication date: June 1, 2009
More about this publication?