Combining Treewidth and Backdoors for CSP

We show that CSP is fixed-parameter tractable when parameterized by the treewidth of a backdoor into any tractable CSP problem over a finite constraint language. This result combines the two prominent approaches for achieving tractability for CSP: (i) by structural restrictions on the interaction between the variables and the constraints and (ii) by language restrictions on the relations that can be used inside the constraints. Apart from defining the notion of backdoor-treewidth and showing how backdoors of small treewidth can be used to efficiently solve CSP, our main technical contribution is a fixed-parameter algorithm that finds a backdoor of small treewidth.

[1]  Phokion G. Kolaitis,et al.  Conjunctive-query containment and constraint satisfaction , 1998, PODS.

[2]  Torben Hagerup,et al.  Parallel Algorithms with Optimal Speedup for Bounded Treewidth , 1995, ICALP.

[3]  Naomi Nishimura,et al.  Detecting Backdoor Sets with Respect to Horn and Binary Clauses , 2004, SAT.

[4]  Michal Pilipczuk,et al.  Designing FPT Algorithms for Cut Problems Using Randomized Contractions , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[5]  Tommy Färnqvist.  Constraint Optimization Problems and Bounded Tree-Width Revisited , 2012, CPAIOR.

[6]  Michael R. Fellows,et al.  An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations , 1989, 30th Annual Symposium on Foundations of Computer Science.

[7]  Saket Saurabh,et al.  Backdoors to q-Horn , 2013, STACS.

[8]  Martin Grohe.  The complexity of homomorphism and constraint satisfaction problems seen from the other side , 2007, JACM.

[9]  Phokion G. Kolaitis,et al.  Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics , 2002, CP.

[10]  Lane A. Hemaspaandra,et al.  SIGACT News Complexity Theory Column 76: an atypical survey of typical-case heuristic algorithms , 2012, SIGA.

[11]  Bruno Courcelle,et al.  An algebraic theory of graph reduction , 1990, JACM.

[12]  Phokion G. Kolaitis.  Constraint Satisfaction, Databases, and Logic , 2003, IJCAI.

[13]  Georg Gottlob,et al.  Hypertree decompositions and tractable queries , 1998, PODS '99.

[14]  Barry O'Sullivan,et al.  Almost 2-SAT is Fixed-Parameter Tractable , 2008, J. Comput. Syst. Sci..

[15]  Ken-ichi Kawarabayashi,et al.  The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[16]  Jaroslav Nesetril,et al.  Colouring, constraint satisfaction, and complexity , 2008, Comput. Sci. Rev..

[17]  Peter Jeavons,et al.  The complexity of maximal constraint languages , 2001, STOC '01.

[18]  Jens Lagergren,et al.  Upper Bounds on the Size of Obstructions and Intertwines , 1998, J. Comb. Theory, Ser. B.

[19]  Marko Samer,et al.  Algorithms for propositional model counting , 2007, J. Discrete Algorithms.

[20]  Ugo Montanari,et al.  Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..

[21]  Andrei A. Bulatov,et al.  A dichotomy theorem for constraint satisfaction problems on a 3-element set , 2006, JACM.

[22]  Jaroslav Nesetril,et al.  On the complexity of H-coloring , 1990, J. Comb. Theory, Ser. B.

[23]  Martin C. Cooper,et al.  Characterising Tractable Constraints , 1994, Artif. Intell..

[24]  53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, October 20-23, 2012 , 2012, FOCS.

[25]  Andrei A. Bulatov,et al.  Complexity of conservative constraint satisfaction problems , 2011, TOCL.

[26]  Fedor V. Fomin,et al.  Solving d-SAT via Backdoors to Small Treewidth , 2015, SODA.

[27]  Stefan Szeider,et al.  Strong Backdoors to Bounded Treewidth SAT , 2012, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[28]  Hans L. Bodlaender,et al.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.

[29]  Reinhard Diestel,et al.  Graph Theory, 4th Edition , 2012, Graduate texts in mathematics.

[30]  Hans L. Bodlaender,et al.  Reduction Algorithms for Constructing Solutions in Graphs with Small Treewidth , 1996, COCOON.

[31]  Nicolas Beldiceanu,et al.  Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems , 2012, Lecture Notes in Computer Science.

[32]  Martin C. Cooper,et al.  Tractability in constraint satisfaction problems: a survey , 2016, Constraints.

[33]  Paul Wollan,et al.  Finding topological subgraphs is fixed-parameter tractable , 2010, STOC '11.

[34]  B. D. Fluiter.  Algorithms for graphs of small treewidth , 1997 .

[35]  Tomás Feder,et al.  The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory , 1999, SIAM J. Comput..

[36]  Andrei A. Bulatov.  The Complexity of the Counting Constraint Satisfaction Problem , 2008, ICALP.

[37]  Víctor Dalmau,et al.  A new tractable class of constraint satisfaction problems , 2005, Annals of Mathematics and Artificial Intelligence.

[38]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs , 1990, Inf. Comput..

[39]  Hans L. Bodlaender.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC '93.

[40]  Fedor V. Fomin,et al.  Treewidth computation and extremal combinatorics , 2008, Comb..

[41]  Robert Ganian,et al.  Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting , 2016, SODA.

[42]  Marc Gyssens,et al.  A unified theory of structural tractability for constraint satisfaction problems , 2008, J. Comput. Syst. Sci..

[43]  Toby Walsh,et al.  Detecting and Exploiting Subproblem Tractability , 2013, IJCAI.

[44]  Eugene C. Freuder.  A sufficient condition for backtrack-bounded search , 1985, JACM.

[45]  Bruno Courcelle,et al.  An algebraic theory of graph reduction , 1993, JACM.

[46]  Thomas J. Schaefer,et al.  The complexity of satisfiability problems , 1978, STOC.

[47]  Stefan Szeider,et al.  Backdoors into heterogeneous classes of SAT and CSP , 2017, J. Comput. Syst. Sci..

[48]  Bart Selman,et al.  Backdoors To Typical Case Complexity , 2003, IJCAI.

[49]  Peter L. Hammer,et al.  Variable and Term Removal From Boolean Formulae , 1997, Discret. Appl. Math..

[50]  Bart Selman,et al.  On the connections between backdoors, restarts, and heavy-tailedness in combinatorial search , 2003 .

[51]  Marko Samer,et al.  Constraint satisfaction with bounded treewidth revisited , 2006, J. Comput. Syst. Sci..

[52]  Dániel Marx,et al.  Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries , 2009, JACM.

[53]  Martin C. Cooper,et al.  On Backdoors to Tractable Constraint Languages , 2014, CP.