Abstract
In this paper, we investigate the complexity of algorithms for solving CSPs which are classically implemented in real practical solvers, such as Forward Checking or Bactracking with Arc Consistency (RFL or MAC).. We introduce a new parameter for measuring their complexity and then we derive new complexity bounds. By relating the complexity of CSP algorithms to graph-theoretical parameters, our analysis allows us to define 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. So, our approach allows us to propose new tractable classes of CSPs that are naturally exploited by solvers, which indicates new ways to explain in some cases the practical efficiency of classical search algorithms.
This work was supported by the French National Research Agency under grant TUPLES (ANR-2010-BLAN-0210).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Rossi, F., van Beek, P., Walsh, T.: Handbook of Constraint Programming. Elsevier (2006)
Haralick, R., Elliot, G.: Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence 14, 263–313 (1980)
Nadel, B.: Tree Search and Arc Consistency in Constraint-Satisfaction Algorithms. In: Search in Artificial Intelligence, pp. 287–342. Springer (1988)
Sabin, D., Freuder, E.C.: Contradicting Conventional Wisdom in Constraint Satisfaction. In: Borning, A. (ed.) PPCP 1994. LNCS, vol. 874, pp. 10–20. Springer, Heidelberg (1994)
Bessière, C., Meseguer, P., Freuder, E.C., Larrosa, J.: On forward checking for non-binary constraint satisfaction. Artificial Intelligence 141, 205–224 (2002)
Freuder, E.: A Sufficient Condition for Backtrack-Free Search. JACM 29(1), 24–32 (1982)
Gottlob, G., Leone, N., Scarcello, F.: A Comparison of Structural CSP Decomposition Methods. Artificial Intelligence 124, 343–382 (2000)
de Givry, S., Schiex, T., Verfaillie, G.: Decomposition arborescente et cohérence locale souple dans les CSP pondérés. In: Proceedings of JFPC 2006 (2006)
Purvis, L., Jeavons, P.: Constraint tractability theory and its application to the product development process for a constraint-based scheduler. In: Proceedings of the 1st International Conference on The Practical Application of Constraint Technologies and Logic Programming, pp. 63–79 (1999); This paper was awarded First Prize in the Constraints Technologies area of PACLP 1999
Rauzy, A.: Polynomial restrictions of SAT: What can be done with an efficient implementation of the Davis and Putnam’s procedure. In: Montanari, U., Rossi, F. (eds.) CP 1995. LNCS, vol. 976, pp. 515–532. Springer, Heidelberg (1995)
Jégou, P., Ndiaye, S., Terrioux, C.: A new evaluation of forward checking and its consequences on efficiency of tools for decomposition of CSPs. In: ICTAI (1), pp. 486–490 (2008)
Ordyniak, S., Paulusma, D., Szeider, S.: Satisfiability of acyclic and almost acyclic CNF formulas. In: FSTTCS, pp. 84–95 (2010)
Jégou, P.: Decomposition of Domains Based on the Micro-Structure of Finite Constraint Satisfaction Problems. In: Proceedings of AAAI 1993, Washington, DC, pp. 731–736 (1993)
Golumbic, M.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)
Cohen, D.A.: A New Class of Binary CSPs for which Arc-Consistency Is a Decision Procedure. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 807–811. Springer, Heidelberg (2003)
Salamon, A.Z., Jeavons, P.G.: Perfect Constraints Are Tractable. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol. 5202, pp. 524–528. Springer, Heidelberg (2008)
El Mouelhi, A.: Generalized micro-structures for non-binary CSP. In: Doctoral Programme CP, pp. 13–18 (2012), http://zivny.cz/dp12/
Dechter, R., Pearl, J.: Tree-Clustering for Constraint Networks. Artificial Intelligence 38, 353–366 (1989)
Rossi, F., Petrie, C., Dhar, V.: On the equivalence of constraint satisfaction problems. In: Proceedings of the 9th European Conference on Artificial Intelligence, pp. 550–556 (1990)
Wood, D.R.: On the maximum number of cliques in a graph. Graphs and Combinatorics 23, 337–352 (2007)
Moon, J.W., Moser, L.: On cliques in graphs. Israel Journal of Mathematics 3, 23–28 (1965)
Dujmovic, V., Fijavz, G., Joret, G., Sulanke, T., Wood, D.R.: On the maximum number of cliques in a graph embedded in a surface. European J. Combinatorics 32(8), 1244–1252 (2011)
Chmeiss, A., Jégou, P.: A generalization of chordal graphs and the maximum clique problem. Information Processing Letters 62, 111–120 (1997)
Third International CSP Solver Competition (2008), http://cpai.ucc.ie/08
Cooper, M., Jeavons, P., Salamon, A.: Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination. Artificial Intelligence 174, 570–584 (2010)
Rosgen, B., Stewart, L.: Complexity results on graphs with few cliques. Discrete Mathematics and Theoretical Computer Science 9, 127–136 (2007)
Cohen, D.A., Cooper, M.C., Green, M.J., Marx, D.: On guaranteeing polynomially bounded search tree size. In: Lee, J. (ed.) CP 2011. LNCS, vol. 6876, pp. 160–171. Springer, Heidelberg (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
El Mouelhi, A., Jégou, P., Terrioux, C., Zanuttini, B. (2013). Some New Tractable Classes of CSPs and Their Relations with Backtracking Algorithms. In: Gomes, C., Sellmann, M. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2013. Lecture Notes in Computer Science, vol 7874. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38171-3_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-38171-3_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38170-6
Online ISBN: 978-3-642-38171-3
eBook Packages: Computer ScienceComputer Science (R0)