On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction

The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously been applied to the study of CSPs with finite or (infinite) omega-categorical templates. Our first result is an exact characterization of those CSPs that can be formulated with (a finite or) an omega-categorical template. The universal-algebraic approach relies on the fact that in finite or omega-categorical structures A, a relation is primitive positive definable if and only if it is preserved by the polymorphisms of A. In this paper, we present results that can be used to study the computational complexity of CSPs with arbitrary infinite templates. Specifically, we prove that every CSP can be formulated with a template A such that a relation is primitive positive definable in A if and only if it is first-order definable on A and preserved by the infinitary polymorphisms of A. We present applications of our general results to the description and analysis of the computational complexity of CSPs. In particular, we present a polymorphism-based description of those CSPs that are first-order definable (and therefore can be solved in polynomial-time), and give general hardness criteria based on the absence of polymorphisms that depend on more than one argument.

[1]  Itay Ben-Yaacov,et al.  Positive Model Theory and Compact Abstract Theories , 2003, J. Math. Log..

[2]  Bruno Poizat.  ThéOrie de Galois pour les ALGèBres de Post Infinitaires , 1981, Math. Log. Q..

[3]  Manuel Bodirsky,et al.  Constraint satisfaction with infinite domains , 2004 .

[4]  Michael Pinsker,et al.  Minimal functions on the random graph and the product ramsey theorem , 2010 .

[5]  Boris A. Romov.  Some properties of local partial clones on an infinite set , 2004, Proceedings. 34th International Symposium on Multiple-Valued Logic.

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

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

[8]  Richard E. Ladner,et al.  On the Structure of Polynomial Time Reducibility , 1975, JACM.

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

[10]  Boris A. Romov.  Positive Primitive Structures , 2009, 2009 39th International Symposium on Multiple-Valued Logic.

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

[12]  D. Marker.  Model theory : an introduction , 2002 .

[13]  I. Rosenberg.  MINIMAL CLONES I: THE FIVE TYPES , 1986 .

[14]  L. A. Kaluzhnin,et al.  Galois theory for post algebras. I , 1969 .

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

[16]  Manuel Bodirsky,et al.  Non-dichotomies in Constraint Satisfaction Complexity , 2008, ICALP.

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

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

[19]  Florian Richoux,et al.  Complexity of Existential Positive First-Order Logic , 2009, CiE.

[20]  D. Geiger.  CLOSED SYSTEMS OF FUNCTIONS AND PREDICATES , 1968 .

[21]  Marc Gyssens,et al.  Closure properties of constraints , 1997, JACM.

[22]  Omer Reingold,et al.  Undirected connectivity in log-space , 2008, JACM.

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

[24]  Ágnes Szendrei,et al.  Clones in universal algebra , 1986 .

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

[26]  Manuel Bodirsky,et al.  Maximal infinite-valued constraint languages , 2009, Theor. Comput. Sci..

[27]  Boris Zilber,et al.  Uncountably Categorical Theories , 1993 .

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