Solution Techniques for Constraint Satisfaction Problems: Advanced Approaches

Conventional techniques for the constraint satisfaction problem (CSP)have had considerable success in their applications. However,there are many areas in which the performance of the basic approachesmay be improved. These include heuristic ordering of certain tasksperformed by the CSP solver, hybrids which combine compatible solutiontechniques and graph based methods which exploit the structure of theconstraint graph representation of a CSP. Also, conventionalconstraint satisfaction techniques only address problems with hardconstraints (i.e. each of which are completely satisfied or completelyviolated, and all of which must be satisfied by a validsolution). Many real applications require a more flexible approachwhich relaxes somewhat these rigid requirements. To address theseissues various approaches have been developed. This paper attempts asystematic review of them.

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

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

[3]  Robert E. Tarjan,et al.  Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs , 1984, SIAM J. Comput..

[4]  Qiang Shen,et al.  Solution Techniques for Constraint Satisfaction Problems: Foundations , 2001, Artificial Intelligence Review.

[5]  Patrick Prosser,et al.  Binary Constraint Satisfaction Problems: Some are Harder than Others , 1994, ECAI.

[6]  Peter C. Cheeseman,et al.  Where the Really Hard Problems Are , 1991, IJCAI.

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

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

[9]  Jérôme Lang,et al.  Possibilistic logic as a logical framework for min-max discrete optimisation problems and prioritized constraints , 1991, FAIR.

[10]  Jean-Claude Latombe,et al.  Making Compromises Among Antagonist Constraints in a Planner , 1985, Artif. Intell..

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

[12]  Janice M. Stone,et al.  Efficient Search Techniques - An Empirical Study of the N-Queens Problem , 1987, IBM J. Res. Dev..

[13]  Paul Walton Purdom,et al.  Search Rearrangement Backtracking and Polynomial Average Time , 1983, Artif. Intell..

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

[15]  Jean-Jacques Chabrier,et al.  Approximate Resolution of Hard Numbering Problems , 1996, AAAI/IAAI, Vol. 1.

[16]  Rina Dechter,et al.  In Search of the Best Constraint Satisfaction Search , 1994, AAAI.

[17]  Rina Dechter,et al.  Look-Ahead Value Ordering for Constraint Satisfaction Problems , 1995, IJCAI.

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

[19]  Didier Dubois,et al.  Possibility theory in constraint satisfaction problems: Handling priority, preference and uncertainty , 1996, Applied Intelligence.

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

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

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

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

[24]  Eugene C. Freuder,et al.  Contradicting Conventional Wisdom in Constraint Satisfaction , 1994, ECAI.

[25]  Philippe David,et al.  When Functional and Bijective Constraints Make a CSP Polynomial , 1993, IJCAI.

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

[27]  Shimon Even,et al.  Graph Algorithms , 1979 .

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

[29]  Jérôme Lang,et al.  Uncertainty in Constraint Satisfaction Problems: a Probalistic Approach , 1993, ECSQARU.

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

[31]  Richard J. Wallace,et al.  Partial Constraint Satisfaction , 1989, IJCAI.

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

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

[34]  Thomas Schiex,et al.  Possibilistic Constraint Satisfaction Problems or "How to Handle Soft Constraints?" , 1992, UAI.

[35]  Thomas Schiex,et al.  Valued Constraint Satisfaction Problems: Hard and Easy Problems , 1995, IJCAI.

[36]  Richard J. Wallace,et al.  Enhancements of Branch and Bound Methods for the Maximal Constraint Satisfaction Problem , 1996, AAAI/IAAI, Vol. 1.