Hybrid backtracking bounded by tree-decomposition of constraint networks

We propose a framework for solving CSPs based both on backtracking techniques and on the notion of tree-decomposition of the constraint networks. This mixed approach permits us to define a new framework for the enumeration, which we expect that it will benefit from the advantages of two approaches: a practical efficiency of enumerative algorithms and a warranty of a limited time complexity by an approximation of the tree-width of the constraint networks. Finally, experimental results allow us to show the advantages of this approach.

[1]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

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

[3]  Christian Bessiere,et al.  MAC and Combined Heuristics: Two Reasons to Forsake FC (and CBJ?) on Hard Problems , 1996, CP.

[4]  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..

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

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

[7]  Jean-François Baget,et al.  Backtracking Through Biconnected Components of a Constraint Graph , 2001, IJCAI.

[8]  Bernard A. Nadel,et al.  Tree search and ARC consistency in constraint satisfaction algorithms , 1988 .

[9]  Dan Geiger,et al.  A sufficiently fast algorithm for finding close to optimal clique trees , 2001, Artif. Intell..

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

[11]  Roberto J. Bayardo,et al.  Counting Models Using Connected Components , 2000, AAAI/IAAI.

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

[13]  Derek G. Corneil,et al.  Complexity of finding embeddings in a k -tree , 1987 .

[14]  Vipin Kumar,et al.  Search in Artificial Intelligence , 1988, Symbolic Computation.

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

[16]  Rina Dechter,et al.  Topological parameters for time-space tradeoff , 1996, Artif. Intell..

[17]  Thomas Schiex,et al.  Russian Doll Search for Solving Constraint Optimization Problems , 1996, AAAI/IAAI, Vol. 1.

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

[19]  Thomas Schiex,et al.  Nogood Recording for static and dynamic constraint satisfaction problems , 1993, Proceedings of 1993 IEEE Conference on Tools with Al (TAI-93).

[20]  Javier Larrosa,et al.  Boosting Search with Variable Elimination , 2000, CP.

[21]  Daniel P. Miranker,et al.  An Optimal Backtrack Algorithm for Tree-Structured Constraint Satisfaction problems , 1994, Artif. Intell..

[22]  Daniel P. Miranker,et al.  A Complexity Analysis of Space-Bounded Learning Algorithms for the Constraint Satisfaction Problem , 1996, AAAI/IAAI, Vol. 1.

[23]  Christian Bessiere,et al.  Refining the Basic Constraint Propagation Algorithm , 2001, JFPLC.

[24]  Anne Berry,et al.  A wide-range efficient algorithm for minimal triangulation , 1999, SODA '99.

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

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

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

[28]  Peter van Beek,et al.  Conflict-Directed Backjumping Revisited , 2011, J. Artif. Intell. Res..

[29]  Georg Gottlob,et al.  A Comparison of Structural CSP Decomposition Methods , 1999, IJCAI.

[30]  Arie M. C. A. Koster,et al.  Frequency assignment : models and algorithms , 1999 .

[31]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

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

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

[34]  M. Golumbic.  Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57) , 2004 .

[36]  Robert E. Tarjan,et al.  Algorithmic Aspects of Vertex Elimination on Graphs , 1976, SIAM J. Comput..

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

[38]  Simon de Givry,et al.  Radio Link Frequency Assignment , 1999, Constraints.

[39]  Paul D. Seymour,et al.  Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.