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

Please sign up or login with your details

Forgot password? Click here to reset