The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns

Résumé

Characterising tractable fragments of the constraint satisfaction problem (CSP) is an important challenge in theoretical computer science and artificial intelligence. Forbidding patterns (generic subinstances) provides a means of defining CSP fragments which are neither exclusively language-based nor exclusively structure-based. It is known that the class of binary CSP instances in which the broken-triangle pattern (BTP) does not occur, a class which includes all tree-structured instances, are decided by arc consistency (AC), a ubiquitous reduction operation in constraint solvers. We provide a characterisation of irreducible partially-ordered forbidden patterns which have this AC-solvability property. It turns out that BTP is just one of five such AC-solvable patterns. The four other patterns allow us to exhibit new tractable classes.
Fichier principal
Vignette du fichier
cooper_18764.pdf (254.86 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01671341 , version 1 (22-12-2017)

Identifiants

Citer

Martin Cooper, Stanislav Živný. The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns. 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2016), IEEE Technical Committee on Mathematical Foundations of Computer Science; ACM Special Interest Group on Logic (SIGLOG), Jul 2016, New York City, United States. pp.652-661, ⟨10.1145/2933575.2933587⟩. ⟨hal-01671341⟩
54 Consultations
58 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More