DeepAI AI Chat
Log In Sign Up

Sensitive instances of the Constraint Satisfaction Problem

by   Libor Barto, et al.

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 𝐀 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 𝐀^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 𝐀 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.


page 1

page 2

page 3

page 4

βˆ™ 01/18/2020

Relational Width of First-Order Expansions of Homogeneous Graphs with Bounded Strict Width

Solving the algebraic dichotomy conjecture for constraint satisfaction p...
βˆ™ 05/19/2014

An Algebraic Hardness Criterion for Surjective Constraint Satisfaction

The constraint satisfaction problem (CSP) on a relational structure B is...
βˆ™ 12/02/2018

Pseudo-loop conditions

We initiate the systematic study of loop conditions of arbitrary finite ...
βˆ™ 04/26/2021

Beyond PCSP(1-in-3,NAE)

The promise constraint satisfaction problem (PCSP) is a recently introdu...
βˆ™ 06/30/2022

Cohomology in Constraint Satisfaction and Structure Isomorphism

Constraint satisfaction (CSP) and structure isomorphism (SI) are among t...
βˆ™ 08/28/2017

Searching for an algebra on CSP solutions

The Constraint Satisfaction Problem (CSP) is a problem of computing a ho...
βˆ™ 10/10/2011

Consistency and Random Constraint Satisfaction Models

In this paper, we study the possibility of designing non-trivial random ...