MAC-CBJ: maintaining arc consistency with conflict-directed backjumping

Sabin and Freuder have demonstrated that increased constraint propagation can lead to a reduction in overall search eeort. They described an algorithm based on arc consistency, and they called it MAC, for maintaining arc consistency. Their algorithm is a chronological backtracker, and it is probable that it can be improved by adding connict-directed backjumping (CBJ). The algorithm MAC-CBJ is described here, without proof, and without a comparative study.

[1]  Christophe Lecoutre.  Constraint Networks , 1992 .

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

[3]  Thomas C. Henderson,et al.  Arc and Path Consistency Revisited , 1986, Artif. Intell..

[4]  Fahiem Bacchus,et al.  Dynamic Variable Ordering in CSPs , 1995, CP.

[5]  Eugene C. Freuder.  Using Metalevel Constraint Knowledge to Reduce Constraint Checking , 1995, Constraint Processing, Selected Papers.

[6]  Christian Bessiere,et al.  Arc-Consistency and Arc-Consistency Again , 1993, Artif. Intell..

[7]  R. Acevedo,et al.  Research report , 1967, Revista odontologica de Puerto Rico.

[8]  Barbara M. Smith,et al.  Sparse Constraint Graphs and Exceptionally Hard Problems , 1995, IJCAI.

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

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

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

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

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

[14]  C. Bessiere,et al.  An arc-consistency algorithm optimal in the number of constraint checks , 1994, Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94.

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

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