Solution Techniques for Constraint Satisfaction Problems: Foundations

The Constraint Satisfaction Problem (CSP) is ubiquitous in artificialintelligence. It has a wide applicability, ranging from machine visionand temporal reasoning to planning and logic programming. This paperattempts a systematic and coherent review of the foundations ofthe techniques for constraint satisfaction. It discusses in detail thefundamental principles and approaches. This includes an initialdefinition of the constraint satisfaction problem, a graphical meansof problem representation, conventional tree search solutiontechniques, and pre-processing algorithms which are designed to makesubsequent tree search significantly easier.

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

[2]  David A. McAllester,et al.  A Rearrangement Search Strategy for Determining Propositional Satisfiability , 1988, AAAI.

[3]  Robert M. Haralick,et al.  Efficient Graph Automorphism by Vertex Partitioning , 1983, Artif. Intell..

[4]  Pascal Van Hentenryck,et al.  An Efficient Arc Consistency Algorithm for a Class of CSP Problems , 1991, IJCAI.

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

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

[7]  Matthew L. Ginsberg,et al.  GSAT and dynamic backtracking , 1994, KR 1994.

[8]  Philippe Jégou,et al.  Path-Consistency: When Space Misses Time , 1996, AAAI/IAAI, Vol. 1.

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

[10]  A. E. Eiben,et al.  Constraint-satisfaction problems. , 2000 .

[11]  Qiang Shen,et al.  Solution Techniques for Constraint Satisfaction Problems: Advanced Approaches , 2001, Artificial Intelligence Review.

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

[13]  Julian R. Ullmann,et al.  An Algorithm for Subgraph Isomorphism , 1976, J. ACM.

[14]  David L. Waltz,et al.  Understanding Line drawings of Scenes with Shadows , 1975 .

[15]  Azriel Rosenfeld,et al.  Scene Labeling by Relaxation Operations , 1976, IEEE Transactions on Systems, Man, and Cybernetics.

[16]  Mark S. Fox,et al.  Constraint-Directed Search: A Case Study of Job-Shop Scheduling , 1987 .

[17]  Thomas Schiex,et al.  Lazy Arc Consistency , 1996, AAAI/IAAI, Vol. 1.

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

[19]  Patrick Prosser,et al.  A Reactive Scheduling Agent , 1989, IJCAI.

[20]  Rina Dechter,et al.  Belief Maintenance in Dynamic Constraint Networks , 1988, AAAI.

[21]  Mark Wallace,et al.  A Generic Model and Hybrid Algorithm for Hoist Scheduling Problems , 1998, CP.

[22]  Edward P. K. Tsang,et al.  The Consistent Labeling Problem in Temporal Reasoning , 1987, AAAI.

[23]  Maurice Bruynooghe.  Graph coloring and constraint satisfaction , 1985 .

[24]  J. Gaschnig.  Performance measurement and analysis of certain search algorithms. , 1979 .

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

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

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

[28]  A. John Mallinckrodt,et al.  Qualitative reasoning: Modeling and simulation with incomplete knowledge , 1994, at - Automatisierungstechnik.

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

[30]  Robert M. Haralick,et al.  Structural Descriptions and Inexact Matching , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

[32]  Rina Dechter,et al.  Enhancement Schemes for Constraint Processing: Backjumping, Learning, and Cutset Decomposition , 1990, Artif. Intell..

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

[34]  Andrew B. Baker,et al.  The Hazards of Fancy Backtracking , 1994, AAAI.

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

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

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

[38]  Rina Dechter,et al.  Dead-End Driven Learning , 1994, AAAI.

[39]  Gerald J. Sussman,et al.  Forward Reasoning and Dependency-Directed Backtracking in a System for Computer-Aided Circuit Analysis , 1976, Artif. Intell..

[40]  Jean-François Rit,et al.  Propagating Temporal Constraints for Scheduling , 1986, AAAI.

[41]  Maurice Bruynooghe,et al.  Solving Combinatorial Search Problems by Intelligent Backtracking , 1981, Inf. Process. Lett..

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

[43]  Drew McDermott,et al.  A General Framework for Reason Maintenance , 1991, Artif. Intell..

[44]  Alan K. Mackworth.  On Reading Sketch Maps , 1977, IJCAI.

[45]  Richard J. Wallace,et al.  Why AC-3 is Almost Always Better than AC4 for Establishing Arc Consistency in CSPs , 1993, IJCAI.

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

[47]  Jon Doyle,et al.  A Truth Maintenance System , 1979, Artif. Intell..

[48]  Avrim Blum,et al.  Fast Planning Through Planning Graph Analysis , 1995, IJCAI.

[49]  Thomas H. Kolbe,et al.  Constraints for Object Recognition in Aerial Images - Handling of Unobserved Features , 1998, CP.

[50]  Rina Dechter,et al.  Experimental Evaluation of Preprocessing Techniques in Constraint Satisfaction Problems , 1989, IJCAI.

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

[52]  Qiang Shen,et al.  Fuzzy qualitative simulation , 1993, IEEE Trans. Syst. Man Cybern..

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

[54]  Qiang Shen,et al.  Extending Qualitative Modelling for Simulation of Time-Delayed Behaviour , 1998 .

[55]  Thomas Schiex,et al.  Stubborness: A Possible Enhancement for Backjumping and Nogood Recording , 1994, ECAI.

[56]  Christian Bessiere,et al.  Using Inference to Reduce Arc Consistency Computation , 1995, IJCAI.

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

[58]  Johan de Kleer,et al.  A Comparison of ATMS and CSP Techniques , 1989, IJCAI.

[59]  Matthew L. Ginsberg,et al.  Dynamic Backtracking , 1993, J. Artif. Intell. Res..

[60]  Edward M. Reingold,et al.  Backtrack programming techniques , 1975, CACM.

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