Sensitive instances of the Constraint Satisfaction Problem

We investigate the impact of modifying the constraining relations of a Constraint Satisfaction Problem (CSP) instance, with a fixed template, on the set of solutions of the instance. More precisely we investigate sensitive instances: an instance of the CSP is called sensitive, if removing any tuple from any constraining relation invalidates some solution of the instance. Equivalently, one could require that every tuple from any one of its constraints extends to a solution of the instance. Clearly, any non-trivial template has instances which are not sensitive. Therefore we follow the direction proposed (in the context of strict width) by Feder and Vardi (SICOMP 1999) and require that only the instances produced by a local consistency checking algorithm are sensitive. In the language of the algebraic approach to the CSP we show that a finite idempotent algebra $\mathbf{A}$ has a $k+2$ variable near unanimity term operation if and only if any instance that results from running the $(k, k+1)$-consistency algorithm on an instance over $\mathbf{A}^2$ is sensitive. A version of our result, without idempotency but with the sensitivity condition holding in a variety of algebras, settles a question posed by G. Bergman about systems of projections of algebras that arise from some subalgebra of a finite product of algebras. Our results hold for infinite (albeit in the case of $\mathbf{A}$ idempotent) algebras as well and exhibit a surprising similarity to the strict width $k$ condition proposed by Feder and Vardi. Both conditions can be characterized by the existence of a near unanimity operation, but the arities of the operations differ by 1.

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

[2]  Martin C. Cooper,et al.  Constraints, Consistency and Closure , 1998, Artif. Intell..

[3]  K. A. Baker,et al.  Polynomial interpolation and the Chinese Remainder Theorem for algebraic systems , 1975 .

[4]  Manuel Bodirsky,et al.  Datalog and constraint satisfaction with infinite templates , 2006, J. Comput. Syst. Sci..

[5]  Yuichi Yoshida,et al.  Testing Assignments to Constraint Satisfaction Problems , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

[6]  R. Willard,et al.  Characterizations of several Maltsev conditions , 2015 .

[7]  Andrei A. Bulatov,et al.  Bounded relational width , 2009 .

[8]  Libor Barto,et al.  Polymorphisms, and How to Use Them , 2017, The Constraint Satisfaction Problem.

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

[10]  James B. Nation,et al.  Problems and Results in Tame Congruence Theory a Survey of the '88 Budapest Workshop , 1992 .

[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]  Libor Barto,et al.  Congruence Distributivity Implies Bounded Width , 2009, SIAM J. Comput..

[13]  Libor Barto,et al.  Absorption in Universal Algebra and CSP , 2017, The Constraint Satisfaction Problem.

[14]  Jonah Horowitz.  Computational Complexity of Various Mal'cEV conditions , 2013, Int. J. Algebra Comput..

[15]  Ágnes Szendrei.  Rosenberg-Type Completeness Criteria for Subclones of Slupecki's Clone , 2012, 2012 IEEE 42nd International Symposium on Multiple-Valued Logic.

[16]  George M. Bergman,et al.  On the existence of subalgebras of direct products with prescribedd-fold projections , 1977 .

[17]  Libor Barto,et al.  The collapse of the bounded width hierarchy , 2016, J. Log. Comput..

[18]  L. Barto.  Finitely Related Algebras in Congruence Distributive Varieties Have Near Unanimity Terms , 2013, Canadian Journal of Mathematics.

[19]  Miroslav Olvs'ak.  The weakest nontrivial idempotent equations , 2016, 1609.00531.

[20]  Michael Pinsker,et al.  Algebraic and model theoretic methods in constraint satisfaction , 2015, ArXiv.