Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH scholarly article en Barto, Libor; Kozik, Marcin; Tan, Johnson; Valeriote, Matt https://www.dagstuhl.de/lipics License: Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)
when quoting this document, please refer to the following
DOI:
URN: urn:nbn:de:0030-drops-125176
URL:

; ; ;

Sensitive Instances of the Constraint Satisfaction Problem

pdf-format:


Abstract

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 in [Feder and Vardi, 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 𝔸² 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.

BibTeX - Entry

@InProceedings{barto_et_al:LIPIcs:2020:12517,
  author =	{Libor Barto and Marcin Kozik and Johnson Tan and Matt Valeriote},
  title =	{{Sensitive Instances of the Constraint Satisfaction Problem}},
  booktitle =	{47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
  pages =	{110:1--110:18},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-138-2},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{168},
  editor =	{Artur Czumaj and Anuj Dawar and Emanuela Merelli},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2020/12517},
  URN =		{urn:nbn:de:0030-drops-125176},
  doi =		{10.4230/LIPIcs.ICALP.2020.110},
  annote =	{Keywords: Constraint satisfaction problem, bounded width, local consistency, near unanimity operation, loop lemma}
}

Keywords: Constraint satisfaction problem, bounded width, local consistency, near unanimity operation, loop lemma
Seminar: 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)
Issue date: 2020
Date of publication: 29.06.2020


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI