Skip to Main content Skip to Navigation
Journal articles

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

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.
Complete list of metadata

Cited literature [39 references]  Display  Hide  Download
Contributor : Open Archive Toulouse Archive Ouverte (oatao) Connect in order to contact the contributor
Submitted on : Thursday, May 28, 2020 - 3:20:41 PM
Last modification on : Wednesday, November 3, 2021 - 7:16:19 AM


Publisher files allowed on an open archive



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



Record views


Files downloads