A Context for Constraint Satisfaction Problem Formulation Selection

Much research effort has been applied to finding effective ways for solving constraint satisfaction problems. However, the most fundamental aspect of constraint satisfaction problem solving, problem formulation, has received much less attention. This is important because the selection of an appropriate formulation can have dramatic effects on the efficiency of any constraint satisfaction problem solving algorithm.In this paper, we address the issue of problem formulation. We identify the heuristic nature of generating a good formulation and we propose a context for this process. Our work presents the research community with a focus for the many elements which affect problem formulation and this is illustrated with the example adding redundant constraints. It also provides a significant step towards the goal of automatic selection of problem formulations.

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

[2]  Barbara M. Smith.  Where the Exceptionally Hard Problems Are 1 , 1995 .

[3]  Rina Dechter,et al.  Removing Redundancies in Constraint Networks , 1987, AAAI.

[4]  Bernard Nudel,et al.  Consistent-Labeling Problems and Their Algorithms: Expected-Complexities and Theory-Based Heuristics , 1983, Artif. Intell..

[5]  Mark Wallace,et al.  Practical applications of constraint programming , 2004, Constraints.

[6]  Richard E. Korf,et al.  Toward a Model of Representation Changes , 1980, Artif. Intell..

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

[8]  Edward P. K. Tsang,et al.  Adaptive Constraint Satisfaction: The Quickest First Principle , 1996, ECAI.

[9]  Rina Dechter,et al.  Network-Based Heuristics for Constraint-Satisfaction Problems , 1987, Artif. Intell..

[10]  Helmut Simonis,et al.  The CHIP System and Its Applications , 1995, CP.

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

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

[13]  Bernard A. Nadel,et al.  Representation selection for constraint satisfaction: a case study using n-queens , 1990, IEEE Expert.

[14]  Jean-François Puget,et al.  Applications of Constraint Programming , 1995, CP.

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

[16]  Francesca Rossi,et al.  Principles and Practice of Constraint Programming — CP '95 , 1995, Lecture Notes in Computer Science.

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

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

[19]  Saul Amarel,et al.  On representations of problems of reasoning about actions , 1968 .

[20]  Bernard Nudel,et al.  Solving the General Consistent Labeling (or Constraint Satisfaction) Problem: Two Algorithms and Their Expected Complexities , 1983, AAAI.

[21]  Barbara M. Smith,et al.  The Phase Transition and the Mushy Region in Constraint Satisfaction Problems , 1994, ECAI.

[22]  Alvin C. M. Kwan.  A framework for mapping constraint satisfaction problems to solution methods , 1997 .

[23]  Ramin Zabih,et al.  Some Applications of Graph Bandwidth to Constraint Satisfaction Problems , 1990, AAAI.

[24]  Toby Walsh,et al.  Easy Problems are Sometimes Hard , 1994, Artif. Intell..

[25]  Eugene C. Freuder,et al.  Interchangeability Supports Abstraction and Reformulation for Multi-Dimensional Constraint Satisfaction , 1997, AAAI/IAAI.

[26]  Mark Wallace,et al.  Constraint logic programming for scheduling and planning , 1995 .

[27]  Bernard Nudel,et al.  Consistent-Labeling Problems and Their Algorithms , 1982, AAAI.

[28]  Pascal Van Hentenryck,et al.  Constraint Satisfaction Using Constraint Logic Programming , 1992, Artif. Intell..

[29]  Tad Hogg,et al.  The Hardest Constraint Problems: A Double Phase Transition , 1994, Artif. Intell..

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