Equivalence Constraint Satisfaction Problems

The following result for finite structures Gamma has been conjectured to hold for all countably infinite omega-categorical structures Gamma: either the model-complete core Delta of Gamma has an expansion by finitely many constants such that the pseudovariety generated by its polymorphism algebra contains a two-element algebra all of whose operations are projections, or there is a homomorphism f from Delta^k to Delta, for some finite k, and an automorphism alpha of Delta satisfying f(x1,...,xk) = alpha(f(x2,...,xk,x1)). This conjecture has been confirmed for all infinite structures Gamma that have a first-order definition over (Q;<), and for all structures that are definable over the random graph. In this paper, we verify the conjecture for all structures that are definable over an equivalence relation with a countably infinite number of countably infinite classes. Our result implies a complexity dichotomy (into NP-complete and P) for a family of constraint satisfaction problems (CSPs) which we call equivalence constraint satisfaction problems. The classification for equivalence CSPs can also be seen as a first step towards a classification of the CSPs for all relational structures that are first-order definable over Allen's interval algebra, a well-known constraint calculus in temporal reasoning.

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

[2]  Manuel Bodirsky,et al.  The Complexity of Equality Constraint Languages , 2006, CSR.

[3]  P. Cameron,et al.  Oligomorphic permutation groups , 1990 .

[4]  James F. Allen.  Maintaining knowledge about temporal intervals , 1983, CACM.

[5]  Manuel Bodirsky,et al.  Complexity Classification in Infinite-Domain Constraint Satisfaction , 2012, ArXiv.

[6]  Libor Barto,et al.  New Conditions for Taylor Varieties and CSP , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

[7]  Jaroslav Nesetril,et al.  Constraint Satisfaction with Countable Homogeneous Templates , 2003, J. Log. Comput..

[8]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[9]  Michael Pinsker,et al.  Decidability of Definability , 2013, The Journal of Symbolic Logic.

[10]  Peter Jeavons,et al.  Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra , 2003, JACM.

[11]  Andrei A. Bulatov.  H-Coloring dichotomy revisited , 2005, Theor. Comput. Sci..

[12]  V. Pestov,et al.  Fraïssé Limits, Ramsey Theory, and topological dynamics of automorphism groups , 2003 .

[13]  Michael Pinsker,et al.  Reducts of Ramsey structures , 2011, AMS-ASL Joint Special Session.

[14]  Bernhard Nebel,et al.  Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra , 1994, JACM.

[15]  Manuel Bodirsky,et al.  The complexity of temporal constraint satisfaction problems , 2008, STOC.

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

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

[18]  Manuel Bodirsky.  Cores of Countably Categorical Structures , 2007, Log. Methods Comput. Sci..

[19]  Wilfrid Hodges,et al.  Model Theory: The existential case , 1993 .

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

[21]  Peter Jeavons,et al.  Building tractable disjunctive constraints , 2000, J. ACM.