The power of arc consistency for CSPs defined by partially-ordered forbidden patterns - Archive ouverte HAL Access content directly
Journal Articles Logical Methods in Computer Science Year : 2017

The power of arc consistency for CSPs defined by partially-ordered forbidden patterns

(1, 2) , (3)
1
2
3

Abstract

Characterising tractable fragments of the constraint satisfaction problem (CSP) is an important challenge in theoretical computer science and arti ficial intelligence. Forbidding patterns (generic sub-instances) provides a means of defi ning 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 simple partially-ordered forbidden patterns which have this AC-solvability property. It turns out that BTP is just one of fi ve such AC-solvable patterns. The four other patterns allow us to exhibit new tractable classes.
Fichier principal
Vignette du fichier
Cooper_22121.pdf (602.45 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-02640799 , version 1 (28-05-2020)

Identifiers

Cite

Martin Cooper, Stanislav Živný. The power of arc consistency for CSPs defined by partially-ordered forbidden patterns. Logical Methods in Computer Science, 2017, 13 (4:26), pp.1-32. ⟨10.23638/LMCS-13(4:26)2017⟩. ⟨hal-02640799⟩
15 View
51 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More