Universal algebra and hardness results for constraint satisfaction problems

We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. These criteria also give non-expressibility results for various restrictions of Datalog. Furthermore, we show that if CSP(Γ) is not first-order definable then it is L-hard. Our proofs rely on tame congruence theory and on a fine-grain analysis of the complexity of reductions used in the algebraic study of CSPs. The results pave the way for a refinement of the dichotomy conjecture stating that each CSP(Γ) lies in P or is NP-complete and they match the recent classification of [1] for Boolean CSP. We also infer a partial classification theorem for the complexity of CSP(Γ) when the associated algebra of Γ is the idempotent reduct of a preprimal algebra.

[1]  Christoph Meinel,et al.  Structure and importance of logspace-MOD class , 1992, Mathematical systems theory.

[2]  Albert Atserias,et al.  On digraph coloring problems and treewidth duality , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[3]  Christoph Meinel,et al.  Structure and Importance of Logspace-MOD-Classes , 1991, STACS.

[4]  Benjamin Rossman,et al.  Existential positive types and preservation under homomorphisms , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[5]  Tomás Feder,et al.  Homomorphism closed vs. existential positive , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[6]  Claude Tardif,et al.  A Characterisation of First-Order Constraint Satisfaction Problems , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[7]  Klaus Denecke,et al.  Universal Algebra and Applications in Theoretical Computer Science , 2018 .

[8]  Andrei A. Bulatov,et al.  Tractable conservative constraint satisfaction problems , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[9]  Michael Sipser,et al.  Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[10]  Stephen A. Cook,et al.  Storage Requirements for Deterministic Polynomial Time Recognizable Languages , 1976, J. Comput. Syst. Sci..

[11]  Phokion G. Kolaitis,et al.  On the Expressive Power of Datalog: Tools and a Case Study , 1995, J. Comput. Syst. Sci..

[12]  Neil Immerman,et al.  The complexity of satisfiability problems: Refining Schaefer's theorem , 2009, J. Comput. Syst. Sci..

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

[14]  Leonid Libkin,et al.  Elements of Finite Model Theory , 2004, Texts in Theoretical Computer Science.

[15]  Omer Reingold,et al.  Undirected ST-connectivity in log-space , 2005, STOC '05.

[16]  M. Valeriote.  A Subalgebra Intersection Property for Congruence Distributive Varieties , 2009, Canadian Journal of Mathematics.

[17]  Peter Jeavons,et al.  Constraint Satisfaction Problems and Finite Algebras , 2000, ICALP.

[18]  Anuj Dawar,et al.  Affine systems of equations and counting infinitary logic , 2009 .

[19]  B. Larose,et al.  Finite posets and topological spaces in locally finite varieties , 2005 .

[20]  Peter Jeavons,et al.  On the Algebraic Structure of Combinatorial Problems , 1998, Theor. Comput. Sci..

[21]  B. Larose,et al.  Bounded width problems and algebras , 2007 .

[22]  Pascal Tesson,et al.  Symmetric Datalog and Constraint Satisfaction Problems in Logspace , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).

[23]  Claude Tardif,et al.  A Characterisation of First-Order Constraint Satisfaction Problems , 2006, LICS.

[24]  Andrei A. Bulatov,et al.  A dichotomy theorem for constraints on a three-element set , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[25]  Víctor Dalmau,et al.  Linear datalog and bounded path duality of relational structures , 2005, Log. Methods Comput. Sci..

[26]  Foto N. Afrati,et al.  Expressiveness of restricted recursive queries , 1989, STOC '89.

[27]  Michael Sipser,et al.  Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

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

[29]  Peter Jeavons,et al.  The Complexity of Constraint Languages , 2006, Handbook of Constraint Programming.

[30]  Neil Immerman,et al.  Descriptive Complexity , 1999, Graduate Texts in Computer Science.

[31]  D. Hobby,et al.  The structure of finite algebras , 1988 .