Tractable Classes of Binary CSPs Defined by Excluded Topological Minors

The binary Constraint Satisfaction Problem (CSP) is to decide whether there exists an assignment to a set of variables which satisfies specified constraints between pairs of variables. A CSP instance can be presented as a labelled graph (called the microstructure) encoding both the forms of the constraints and where they are imposed. We consider subproblems defined by restricting the allowed form of the microstructure. One form of restriction that has previously been considered is to forbid certain specified substructures (patterns). This captures some tractable classes of the CSP, but does not capture the well-known property of acyclicity. In this paper we introduce the notion of a topological minor of a binary CSP instance. By forbidding certain patterns as topological minors we obtain a compact mechanism for expressing several novel tractable classes, including new generalisations of the class of acyclic instances.

[1]  Philippe Jégou.  Decomposition of Domains Based on the Micro-Structure of Finite Constraint-Satisfaction Problems , 1993, AAAI.

[2]  Martin C. Cooper,et al.  Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination , 2010, Artif. Intell..

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

[4]  Philippe Jégou,et al.  Some New Tractable Classes of CSPs and Their Relations with Backtracking Algorithms , 2013, CPAIOR.

[5]  G. Dirac.  SHORT PROOF OF MENGER'S GRAPH THEOREM , 1966 .

[6]  Peter Jeavons,et al.  Symmetry Definitions for Constraint Satisfaction Problems , 2005, CP.

[7]  Libor Barto,et al.  Constraint Satisfaction Problems Solvable by Local Consistency Methods , 2014, JACM.

[8]  David Cohen.  chapter 11 – Tractable Constraint Languages , 2003 .

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

[10]  Eugene C. Freuder.  A Sufficient Condition for Backtrack-Free Search , 1982, JACM.

[11]  Martin C. Cooper,et al.  Variable Elimination in Binary CSP via Forbidden Patterns , 2013, IJCAI.

[12]  Toby Walsh,et al.  Handbook of Constraint Programming , 2006, Handbook of Constraint Programming.

[13]  Martin Grohe,et al.  The complexity of homomorphism and constraint satisfaction problems seen from the other side , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[14]  Yee Teh,et al.  Wagner ' s Conjecture , 2022 .

[15]  Martin C. Cooper,et al.  Tractable Triangles and Cross-Free Convexity in Discrete Optimisation , 2012, J. Artif. Intell. Res..

[16]  Paul D. Seymour,et al.  Graph Minors. XX. Wagner's conjecture , 2004, J. Comb. Theory B.

[17]  Guillaume Escamocher.  Forbidden patterns in constraint satisfaction problems , 2014 .

[18]  Peter Jeavons,et al.  Perfect Constraints Are Tractable , 2008, CP.

[19]  Martin C. Cooper,et al.  A Dichotomy for 2-Constraint Forbidden CSP Patterns , 2012, AAAI.

[20]  Ola Angelsmark,et al.  A Microstructure Based Approach to Constraint Satisfaction Optimisation Problems , 2005, FLAIRS Conference.

[21]  G. A. Dirac,et al.  CONNECTIVITY IN GRAPHS (Mathematical Expositions No.15) , 1968 .

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

[23]  S. Griffis.  EDITOR , 1997, Journal of Navigation.

[24]  W. T. Tutte.  Connectivity in graphs , 1966 .

[25]  Martin C. Cooper,et al.  The tractability of CSP classes defined by forbidden patterns , 2012, J. Artif. Intell. Res..