On Singleton Arc Consistency for Natural CSPs Defined by Forbidden Patterns

04/20/2017
by   Clement Carbonnel, et al.
0

Singleton arc consistency is an important type of local consistency which has been recently shown to solve all constraint satisfaction problems (CSPs) over constraint languages of bounded width. We aim to characterise all classes of CSPs defined by a forbidden pattern that are solved by singleton arc consistency and closed under removing constraints. We identify five new patterns whose absence ensures solvability by singleton arc consistency, four of which are provably maximal and three of which generalise 2-SAT. Combined with simple counter-examples for other patterns, we make significant progress towards a complete classification.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/26/2011

Arc Consistency and Friends

A natural and established way to restrict the constraint satisfaction pr...
research
10/10/2011

Set Intersection and Consistency in Constraint Networks

In this paper, we show that there is a close relation between consistenc...
research
06/30/2022

Cohomology in Constraint Satisfaction and Structure Isomorphism

Constraint satisfaction (CSP) and structure isomorphism (SI) are among t...
research
01/18/2012

A Dichotomy for 2-Constraint Forbidden CSP Patterns

Although the CSP (constraint satisfaction problem) is NP-complete, even ...
research
01/18/2014

Local Consistency and SAT-Solvers

Local consistency techniques such as k-consistency are a key component o...
research
09/27/2019

SAT vs CSP: a commentary

In 2000, I published a relatively comprehensive study of mappings betwee...
research
06/03/2011

Domain Filtering Consistencies

Enforcing local consistencies is one of the main features of constraint ...

Please sign up or login with your details

Forgot password? Click here to reset