Skip to Main content Skip to Navigation
Conference papers

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

Cited literature [33 references]  Display  Hide  Download
Contributor : Open Archive Toulouse Archive Ouverte (oatao) <>
Submitted on : Friday, December 22, 2017 - 10:49:44 AM
Last modification on : Tuesday, September 8, 2020 - 4:40:08 PM


Files produced by the author(s)


  • HAL Id : hal-01671341, version 1
  • OATAO : 18764


Martin Cooper, Stanislav Zivny. 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), Jul 2016, New York City, United States. pp. 652-661. ⟨hal-01671341⟩



Record views


Files downloads