Logic Programming Approaches for Representing and Solving Constraint Satisfaction Problems: A Comparison

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).

[1]  Pascal Van Hentenryck.  Constraint satisfaction in logic programming , 1989, Logic programming.

[2]  Danny De Schreye,et al.  Answer Set Planning , 1999 .

[3]  Danny De Schreye,et al.  Implementing a Finite-domain CLP-language on Top of Prolog: a Transformational Approach , 1994, LPAR.

[4]  Marc Denecker,et al.  Extending Classical Logic with Inductive Definitions , 2000, Computational Logic.

[5]  Edward P. K. Tsang,et al.  Foundations of constraint satisfaction , 1993, Computation in cognitive science.

[6]  Maurice Bruynooghe,et al.  A Comparison of Logic Programming Approaches for Representation and Solving of Constraint Satisfaction Problems , 2000, ArXiv.

[7]  Victor W. Marek,et al.  Stable models and an alternative logic programming paradigm , 1998, The Logic Programming Paradigm.

[8]  Antonis C. Kakas,et al.  Integrating Abductive and Constraint Logic Programming , 1995 .

[9]  Danny De Schreye,et al.  SLDNFA: An Abductive Procedure for Abductive Logic Programs , 1998, J. Log. Program..

[10]  Alan K. Mackworth.  The Logic of Constraint Satisfaction , 1991, Artif. Intell..

[11]  Ilkka Niemelä,et al.  Efficient Implementation of the Well-founded and Stable Model Semantics , 1996, JICSLP.

[12]  Paolo Mancarella,et al.  Abductive Logic Programming , 1992, LPNMR.

[13]  Hantao Zhang,et al.  Constraint Propagation in Model Generation , 1995, CP.

[14]  Bert Van Nuffelen,et al.  Problem solving in ID-logic with aggregates: some experiments , 2000, arXiv.org.

[15]  Henk Vandecasteele,et al.  Constraint logic programming: applications and implementation , 1999 .

[16]  Bert Van Nuffelen,et al.  Experiments for integration CLP and abduction , 1999 .

[17]  Joxan Jaffar,et al.  Constraint logic programming , 1987, POPL '87.

[18]  Ilkka Niemelä,et al.  Stable Model Semantics of Weight Constraint Rules , 1999, LPNMR.

[19]  Antonis C. Kakas,et al.  ACLP: Abductive Constraint Logic Programming , 2000, J. Log. Program..

[20]  Robert A. Kowalski,et al.  Abduction Compared with Negation by Failure , 1989, ICLP.

[21]  Danny De Schreye,et al.  Scheduling by ''abductive execution'' of a classical logic specification , 1997 .

[22]  Michael J. Maher,et al.  Constraint Logic Programming: A Survey , 1994, J. Log. Program..