Maintaining Arc-Consistency within Dynamic Backtracking

Most of complete search algorithms over Constraint Satisfaction Problems (csp) are based on Standard Backtracking. Two main enhancements of this basic scheme have been studied: first, to integrate constraint propagation as mac which maintains arc consistency during search; second, intelligent backtrackers which avoid repeatedly falling in the same dead-ends by recording nogoods as Conflict-directed BackJumping (cbj) or Dynamic Backtracking (dbt). Integrations of constraint propagation within intelligent backtrackers have been done as mac-cbj which maintains arc consistency in cbj. However, Bessiere and REgin have shown that mac-cbj was very rarely better than mac. However, the inadequacy of mac-cbj is more related to the fact that cbj does not avoid thrashing than to the cost of the management of nogoods. This paper describes and evaluates mac-dbt which maintains arc-consistency in dbt. Experiments show that mac-dbt is able to solve very large problems and that it remains very stable as the size of the problems increases. Moreover, mac-dbt outperforms mac on the structured problems we have randomly generated.

[1]  Narendra Jussien,et al.  Improving Branch-and-Bound algorithms for Open-Shop problems , 1999 .

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

[3]  Thomas Schiex,et al.  Nogood Recording for Static and Dynamic Constraint Satisfaction Problems , 1994, Int. J. Artif. Intell. Tools.

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

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

[6]  Christian Bessiere,et al.  Arc-Consistency in Dynamic Constraint Satisfaction Problems , 1991, AAAI.

[7]  Narendra Jussien,et al.  Dynamic Domain Splitting for Numeric CSPs , 1998, ECAI.

[8]  Narendra Jussien,et al.  The Path repair algorithm , 2000, Electron. Notes Discret. Math..

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

[10]  Roberto J. Bayardo,et al.  Using CSP Look-Back Techniques to Solve Exceptionally Hard SAT Instances , 1996, CP.

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

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

[13]  Christian Bessiere,et al.  From Restricted Path Consistency to Max-Restricted Path Consistency , 1997, CP.

[14]  Roberto J. Bayardo,et al.  Using CSP Look-Back Techniques to Solve Real-World SAT Instances , 1997, AAAI/IAAI.

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

[16]  Christian Bliek,et al.  Generalizing Partial Order and Dynamic Backtracking , 1998, AAAI/IAAI.

[17]  Narendra Jussien,et al.  Relaxation de Contraintes pour les problèmes dynamiques , 1997 .

[18]  Romuald Debruyne,et al.  Arc-consistency in dynamic CSPs is no more prohibitive , 1996, Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence.

[19]  Patrick Prosser,et al.  MAC-CBJ: maintaining arc consistency with conflict-directed backjumping , 1995 .