Dynamic Bundling: Less Effort for More Solutions

Bundling of the values of variables in a Constraint Satisfaction Problem (CSP) as the search proceeds is an abstraction mechanism that yields a compact representation of the solution space. We have previously established that, in spite of the effort of recomputing the bundles, dynamic bundling is never less effective than static bundling and nonbundling search strategies. Objections were raised that bundling mechanisms (whether static or dynamic) are too costly and not worthwhile when one is not seeking all solutions to the CSP. In this paper, we dispel these doubts and empirically show that (1) dynamic bundling remains superior in this context, (2) it does not require a full lookahead strategy, and (3) it dramatically reduces the cost of solving problems at the phase transition while yielding a bundle of multiple, robust solutions.

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

[2]  Berthe Y. Choueiry,et al.  How the Level of Interchangeability Embedded in a Finite Constraint Satisfaction Problem Affects the Performance of Search , 2001, Australian Joint Conference on Artificial Intelligence.

[3]  Berthe Y. Choueiry,et al.  On the Dynamic Detection of Interchangeability in Finite Constraint Satisfaction Problems , 2001, CP.

[4]  J.W.L. Glaisher,et al.  LXI. On the problem of the eight queens , 1874 .

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

[6]  Thomas Ellman,et al.  Abstraction via Approximate Symmetry , 1993, IJCAI.

[7]  Jay P. Fillmore,et al.  On Backtracking: A Combinatorial Description of the Algorithm , 1974, SIAM J. Comput..

[8]  Matthew L. Ginsberg,et al.  Supermodels and Robustness , 1998, AAAI/IAAI.

[9]  Marius-Calin Silaghi,et al.  Ways of Maintaining Arc Consistency in Search Using the Cartesian Representation , 1999, New Trends in Constraints.

[10]  Guevara Noubir,et al.  On the Computation of Local Interchangeability in Discrete Constraint Satisfaction Problems , 1998, AAAI/IAAI.

[11]  Eugene C. Freuder.  Eliminating Interchangeable Values in Constraint Satisfaction Problems , 1991, AAAI.

[12]  Jean-François Puget,et al.  On the Satisfiability of Symmetrical Constrained Satisfaction Problems , 1993, ISMIS.

[13]  Paul Walton Purdom,et al.  Backtrack Searching in the Presence of Symmetry , 1988, Nord. J. Comput..

[14]  Berthe Y. Choueiry,et al.  Abstraction by Interchangeability in Resource Allocation , 1995, IJCAI.

[15]  Alois Haselböck,et al.  Exploiting Interchangeabilities in Constraint-Satisfaction Problems , 1993, IJCAI.