Finite Domain Constraint Problems and their Relationship with Logic Programming

The paper gives a very informal overview of the main results in the area of finite domain constraint satisfaction problems (CSPs). Particular attention is put into the description of local consistency algorithms, which efficiently solve some classes of constraint problems, and of the relationship between CSPs and logic programming. In fact, logic programming, as well as some other language paradigms which were born to extend logic programming (like constraint logic programming and concurrent constraint logic programming) seems to be very suitable to naturally represent and solve CSPs, and also to use them to provide a general notion of computing with constraints.

[1]  Eugene C. Freuder.  Backtrack-free and backtrack-bounded search , 1988 .

[2]  Francesca Rossi.  Constraint satisfaction problems in logic programming , 1988, SGAR.

[3]  Rina Dechter,et al.  Network-based heuristics for constraint satisfaction problems , 1988 .

[4]  Alberto Martelli,et al.  On the Complexity of Admissible Search Algorithms , 1977, Artif. Intell..

[5]  U. Montanari,et al.  Nonserial Dynamic Programming: On the Optimal Strategy of Variable Elimination for the Rectangular Lattice , 1972 .

[6]  Charles J. Petrie,et al.  On the Equivalence of Constraint Satisfaction Problems , 1990, ECAI.

[7]  Maurice Bruynooghe,et al.  The Compilation of Forward Checking Regimes through Meta-Interpretation and Transformation , 1988, META.

[8]  Dana S. Scott,et al.  Concurrent constraint programming languages , 1989 .

[9]  Ugo Montanari,et al.  Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..

[10]  Francesca Rossi,et al.  Perfect Relaxation in Constraint Logic Programming , 1991, ICLP.

[11]  Ehud Shapiro,et al.  The family of concurrent logic programming languages , 1989, CSUR.

[12]  Francesca Rossi,et al.  Fundamental properties of networks of constraints: A new formulation , 1988 .

[13]  James F. Allen.  Towards a General Theory of Action and Time , 1984, Artif. Intell..

[14]  W. Older,et al.  Extending Prolog with Constraint Arithmetic on Real Intervals , 1990 .

[15]  Alain Colmerauer,et al.  Opening the Prolog III universe , 1987 .

[16]  Klaus Estenfeld.  6th International Conference on Logic Programming , 1989, Künstliche Intell..

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

[18]  Maurice Bruynooghe,et al.  Implementing Finite-domain Constraint Logic Programming on Top of a Prolog-System with Delay-mechanism , 1990, ESOP.

[19]  Francesca Rossi,et al.  An Efficient Algorithm for the Solution of Hierarchical Networks of Constraints , 1986, Graph-Grammars and Their Application to Computer Science.

[20]  Rina Dechter,et al.  Temporal Constraint Networks , 1989, Artif. Intell..

[21]  Francesca Rossi,et al.  Exact Solution in Linear Time of Networks of Constraints Using Perfect Relaxation , 1989, KR.

[22]  Francesca Rossi,et al.  Constraint Relaxation may be Perfect , 1991, Artif. Intell..

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

[24]  Eugene C. Freuder.  Synthesizing constraint expressions , 1978, CACM.

[25]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..

[26]  Michael J. Maher,et al.  Constraint Hierarchies and Logic Programming , 1989, ICLP.

[27]  Vijay A. Saraswat,et al.  Concurrent constraint programming , 1989, POPL '90.

[28]  John Wylie Lloyd,et al.  Foundations of Logic Programming , 1987, Symbolic Computation.