Title:Logic Programming Approaches for Representing and Solving
      Constraint Satisfaction Problems: A Comparison
Authors: Nikolay Pelov, Emmanuel De Mot, Marc  Denecker

Abstract:

Many logic programming based approaches can be used to describe and
solve combinatorial search problems. On the one hand there is
constraint logic programming which computes a solution as an answer
substitution to a query containing the variables of the constraint
satisfaction problem. On the other hand there are systems based on
stable model semantics, abductive systems, and first order logic model
generators which compute solutions as models of some theory.  This
paper compares these different approaches from the point of view of
knowledge representation (how declarative are the programs) and from
the point of view of performance (how good are they at solving typical
problems).