Cooper, Martin C. and Živný, Stanislav - The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns

lmcs:4168 - Logical Methods in Computer Science, December 27, 2017, Volume 13, Issue 4
The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns

Authors: Cooper, Martin C. and Živný, Stanislav

Characterising tractable fragments of the constraint satisfaction problem (CSP) is an important challenge in theoretical computer science and artificial intelligence. Forbidding patterns (generic sub-instances) 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 simple 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.


Source : oai:arXiv.org:1604.07981
DOI : 10.23638/LMCS-13(4:26)2017
Volume: Volume 13, Issue 4
Published on: December 27, 2017
Submitted on: November 6, 2017
Keywords: Computer Science - Computational Complexity,Computer Science - Artificial Intelligence,68Q15,F.4.1


Share

Consultation statistics

This page has been seen 121 times.
This article's PDF has been downloaded 49 times.