The Complexity of General-Valued CSPs Seen from the Other Side

The constraint satisfaction problem (CSP) is concerned with homomorphisms between two structures. For CSPs with restricted left-hand side structures, the results of Dalmau, Kolaitis, and Vardi [CP'02], Grohe [FOCS'03/JACM'07], and Atserias, Bulatov, and Dalmau [ICALP'07] establish the precise borderline of polynomial-time solvability (subject to complexity-theoretic assumptions) and of solvability by bounded-consistency algorithms (unconditionally) as bounded treewidth modulo homomorphic equivalence. The general-valued constraint satisfaction problem (VCSP) is a generalisation of the CSP concerned with homomorphisms between two valued structures. For VCSPs with restricted left-hand side valued structures, we establish the precise borderline of polynomial-time solvability (subject to complexity-theoretic assumptions) and of solvability by the k-th level of the Sherali-Adams LP hierarchy (unconditionally). We also obtain results on related problems concerned with finding a solution and recognising the tractable cases; the latter has an application in database theory.

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

[2]  Tommy Färnqvist.  Exploiting Structure in CSP-related Problems , 2013 .

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

[4]  Val Tannen,et al.  The Semiring Framework for Database Provenance , 2017, PODS.

[5]  Stanislav Zivny,et al.  The Power of Sherali-Adams Relaxations for General-Valued CSPs , 2016, SIAM J. Comput..

[6]  Marcin Kozik,et al.  Algebraic Properties of Valued Constraint Satisfaction Problem , 2014, ICALP.

[7]  David Gale.  The theory of linear economic models , 1960 .

[8]  Stanislav Zivny,et al.  The Power of Linear Programming for Valued CSPs , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[9]  Dániel Marx,et al.  Enumerating Homomorphisms , 2009, STACS.

[10]  Hubie Chen,et al.  A Trichotomy in the Complexity of Counting Answers to Conjunctive Queries , 2014, ICDT.

[11]  Eugene C. Freuder.  Complexity of K-Tree Structured Constraint Satisfaction Problems , 1990, AAAI.

[12]  Andrei A. Bulatov,et al.  A Dichotomy Theorem for Nonuniform CSPs , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

[13]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[14]  Peter Jonsson,et al.  Bounded Tree-Width and CSP-Related Problems , 2007, ISAAC.

[15]  Paul D. Seymour,et al.  Graph minors. V. Excluding a planar graph , 1986, J. Comb. Theory B.

[16]  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..

[17]  Warren P. Adams,et al.  A hierarchy of relaxation between the continuous and convex hull representations , 1990 .

[18]  Roman Barták,et al.  Constraint Processing , 2009, Encyclopedia of Artificial Intelligence.

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

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

[21]  Dmitriy Zhuk,et al.  A Proof of CSP Dichotomy Conjecture , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

[22]  Daniel Bienstock,et al.  Tree-width and the Sherali-Adams operator , 2004, Discret. Optim..

[23]  Georg Gottlob,et al.  Tractable Optimization Problems through Hypergraph-Based Structural Restrictions , 2009, ICALP.

[24]  Egor V. Kostylev,et al.  Classification of annotation semirings over containment of conjunctive queries , 2014, ACM Trans. Database Syst..

[25]  Libor Barto,et al.  The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell) , 2008, SIAM J. Comput..

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

[27]  Pawel M. Idziak,et al.  Tractability and learnability arising from algebras with few subpowers , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).

[28]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[29]  Michael R. Fellows,et al.  Fixed-Parameter Tractability and Completeness II: On Completeness for W[1] , 1995, Theor. Comput. Sci..

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

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

[32]  Stanislav Zivny,et al.  The Complexity of Finite-Valued CSPs , 2016, J. ACM.

[33]  Todd J. Green,et al.  Containment of Conjunctive Queries on Annotated Relations , 2009, ICDT '09.

[34]  Ashok K. Chandra,et al.  Optimal implementation of conjunctive queries in relational data bases , 1977, STOC '77.

[35]  Paul D. Seymour,et al.  Graph minors. III. Planar tree-width , 1984, J. Comb. Theory B.

[36]  Martin C. Cooper,et al.  The complexity of soft constraint satisfaction , 2006, Artif. Intell..

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

[38]  Hanif D. Sherali,et al.  A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems , 1990, SIAM J. Discret. Math..

[39]  Stanislav Zivny,et al.  The complexity of finite-valued CSPs , 2013, STOC '13.

[40]  Michael R. Fellows,et al.  FIXED-PARAMETER TRACTABILITY AND COMPLETENESS , 2022 .

[41]  Vladimir Kolmogorov,et al.  The Complexity of General-Valued CSPs , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

[42]  Georg Gottlob,et al.  Hypertree Decompositions: Questions and Answers , 2016, PODS.

[43]  Umberto Bertelè,et al.  Nonserial Dynamic Programming , 1972 .

[44]  Andrei A. Bulatov,et al.  On the Power of k -Consistency , 2007, ICALP.

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

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

[47]  Martin Koutecký,et al.  Extended Formulation for CSP that is Compact for Instances of Bounded Treewidth , 2015, Electron. J. Comb..

[48]  Robin Thomas,et al.  Graph Searching and a Min-Max Theorem for Tree-Width , 1993, J. Comb. Theory, Ser. B.

[49]  Peter Jeavons,et al.  Classifying the Complexity of Constraints Using Finite Algebras , 2005, SIAM J. Comput..