Enhancing the Constraint-Solving Power of CLP(FD) by Means of Path-Consistency Methods

We consider methods for handling constraints over finite domains based on the notion of path consistency. We show that these methods can be easily integrated in the glass-box constraint-solver of the clp(FD) system. Besides the clp(FD) indexical constraints encoding (partial) arc-consistency methods, we introduce new primitive constraints, that we call m-constraints, which encode path-consistency methods. These new constraints increase the constraint-solving power and the extensibility of the clp(FD) language.

[1]  Bernard A. Nadel,et al.  Constraint satisfaction algorithms 1 , 1989, Comput. Intell..

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

[3]  Nicolas Beldiceanu,et al.  Overview of the CHIP Compiler System , 1993, WCLP.

[4]  Christian Bessiere,et al.  Arc-Consistency and Arc-Consistency Again , 1993, Artif. Intell..

[5]  Alain Colmerauer,et al.  An introduction to Prolog III , 1989, CACM.

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

[7]  Barbara M. Smith.  How to Solve the Zebra Problem, or Path Consistency the Easy Way , 1992, ECAI.

[8]  Eugene C. Freuder.  A Sufficient Condition for Backtrack-Free Search , 1982, JACM.

[9]  Thomas C. Henderson,et al.  Arc and Path Consistency Revisited , 1986, Artif. Intell..

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

[11]  Vipin Kumar,et al.  Algorithms for Constraint-Satisfaction Problems: A Survey , 1992, AI Mag..

[12]  Hassan Aït-Kaci.  Warren's Abstract Machine , 1991, ICLP.

[13]  André Vellino,et al.  Constraint Arithmetic on Real Intervals , 1993, WCLP.

[14]  Pascal Van Hentenryck,et al.  The Constraint Logic Programming Language CHIP , 1988, FGCS.

[15]  Roland H. C. Yap,et al.  The CLP( R ) language and system , 1992, TOPL.

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

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

[18]  Pascal Van Hentenryck,et al.  A Generic Arc-Consistency Algorithm and its Specializations , 1992, Artif. Intell..

[19]  Philippe Codognet,et al.  A Minimal Extension of the WAM for clp(FD) , 1993, ICLP.

[20]  Philippe Codognet,et al.  Path Consistency in clp(FD) , 1994, CCL.

[21]  Robert M. Haralick,et al.  Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..

[22]  Chia-Hoang Lee,et al.  Comments on Mohr and Henderson's Path Consistency Algorithm , 1988, Artif. Intell..

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

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

[25]  Peter van Beek,et al.  On the Minimality and Decomposability of Constraint Networks , 1992, AAAI.

[26]  Pascal Van Hentenryck,et al.  The Cardinality Operator: A New Logical Connective for Constraint Logic Programming , 1990, WCLP.

[27]  Pascal Van Hentenryck,et al.  Solving Large Combinatorial Problems in Logic Programming , 1990, J. Log. Program..

[28]  Eugene C. Freuder,et al.  The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems , 1985, Artif. Intell..

[29]  Martin C. Cooper.  An Optimal k-Consistency Algorithm , 1989, Artif. Intell..

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