On Singleton Arc Consistency for CSPs Defined by Monotone Patterns - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Algorithmica Année : 2019

On Singleton Arc Consistency for CSPs Defined by Monotone Patterns

Résumé

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.

Dates et versions

hal-02930064 , version 1 (04-09-2020)

Licence

Paternité

Identifiants

Citer

Clément Carbonnel, David Cohen, Martin Cooper, Stanislav Živný. On Singleton Arc Consistency for CSPs Defined by Monotone Patterns. Algorithmica, 2019, 81 (4), pp.1699-1727. ⟨10.1007/s00453-018-0498-2⟩. ⟨hal-02930064⟩
32 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More