A comparison of CLP(FD) and ASP solutions to NP-complete problems

Abstract

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). © Springer-Verlag Berlin Heidelberg 2005.

Publication
Lecture Notes in Computer Science
Date
Links