A CSP search algorithm with reduced branching factor

Authors:
Igor Razgon;Amnon Meisels
Affiliations:
Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel;Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel
Venue:
CSCLP'05 Proceedings of the 2005 Joint ERCIM/CoLogNET international conference on Constraint Solving and Constraint Logic Programming
Year:
2005

Citing 6
Cited 0

Bucket elimination: a unifying framework for reasoning

Artificial Intelligence
Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Constraint Propagation in Graph Coloring

Journal of Heuristics
Modelling and Solving Employee Timetabling Problems

Annals of Mathematics and Artificial Intelligence
Constraint Processing

Constraint Processing
Constraints, consistency and closure

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an attempt to construct a ”practical” CSP algorithm that assigns a variable with 2 values at every step. Such a strategy has been successfully used for construction of ”theoretical” constraint solvers because it decreases twice the base of the exponent of the upper bound of the search algorithm. We present a solver based on the strategy. The pruning mechanism of the algorithm resembles Forward Checking (FC), therefore we term it 2FC. According to our experimental evaluation, 2FC outperforms FC on graph coloring problems and on non-dense instances of randomly generated CSPs.