On the Efficiency of Backtracking Algorithms for Binary Constraint Satisfaction Problems

Achref El Mouelhi, Philippe Jégou, Cyril Terrioux, Bruno Zanuttini
2012 International Symposium on Artificial Intelligence and Mathematics  
The question of tractable classes of constraint satisfaction problems (CSPs) has been studied for a long time, and is now a very active research domain. However, studies of tractable classes are typically very theoretical. They usually introduce classes of instances together with polynomial time algorithms for recognizing and solving them, and the algorithms can be used only for the new class. In this paper, we address the issue of tractable classes of CSPs from a different perspective. We
more » ... tigate the complexity of classical, generic algorithms for solving CSPs (such as Forward Checking). We introduce a new parameter for measuring their complexity and derive new complexity bounds. By relating the complexity of CSP algorithms to graph-theoretic parameters, our analysis allows us to point at new tractable classes, which can be solved directly by the usual CSP algorithms in polynomial time, and without the need to recognize the classes in advance.
dblp:conf/isaim/MouelhiJTZ12 fatcat:fjqr6zezvvcnnk2qtsg7s3eede