A new synthesis algorithm for solving CSPsWanlin

A new synthesis method, called constraint-directed-generate-and-test (CDGT), is presented for solving constraint satisfaction problems (CSPs). Instead of appending a new instantiation of one variable to a partial solution, as in traditional search methods , CDGT joins two sets of partial solutions and then checks against other relevant constraints to obtain a set of higher order partial solutions. CDGT can be used to achieve local consistency when it is interleaved with backtracking search, or to nd all solutions when needed. It is eecient for tight CSPs and it can be implemented for parallel execution.

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

[2]  Raimund Seidel,et al.  A New Method for Solving Constraint Satisfaction Problems , 1981, IJCAI.

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

[4]  Pedro Meseguer,et al.  Constraint Satisfaction Problems: An Overview , 1989, AI Commun..

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

[6]  Patrick Prosser,et al.  HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM , 1993, Comput. Intell..

[7]  Rina Dechter,et al.  GSAT and Local Consistency , 1995, IJCAI.

[8]  J. J. McGregor.  Relational consistency algorithms and their application in finding subgraph and graph isomorphisms , 1979, Inf. Sci..

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

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

[11]  Peter van Beek,et al.  A Theoretical Evaluation of Selected Backtracking Algorithms , 1995, IJCAI.

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

[13]  Rina Dechter,et al.  Tree Clustering for Constraint Networks , 1989, Artif. Intell..

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

[15]  Christophe Lecoutre.  Constraint Networks , 1992 .

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

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

[18]  Yangjun Chen,et al.  Improving Han and Lee's path consistency algorithm , 1991, [Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91.