On Singleton Arc Consistency for CSPs Defined by Monotone Patterns
Computational Complexity
2019-06-28 v4 Artificial Intelligence
Discrete Mathematics
Abstract
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.
Keywords
Cite
@article{arxiv.1704.06215,
title = {On Singleton Arc Consistency for CSPs Defined by Monotone Patterns},
author = {Clement Carbonnel and David A. Cohen and Martin C. Cooper and Stanislav Zivny},
journal= {arXiv preprint arXiv:1704.06215},
year = {2019}
}
Comments
v4: Full version of a STACS'18 paper; improved presentation