The power of arc consistency for CSPs defined by partially-ordered forbidden patterns
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 no...
Główni autorzy: | Cooper, M, Zivny, S |
---|---|
Format: | Conference item |
Wydane: |
Association for Computing Machinery
2016
|
Podobne zapisy
-
The power of arc consistency for CSPs defined by partially-ordered forbidden patterns
od: Cooper, M, i wsp.
Wydane: (2017) -
The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns
od: Martin C. Cooper, i wsp.
Wydane: (2017-12-01) -
On singleton arc consistency for CSPs defined by monotone patterns
od: Carbonnel, C, i wsp.
Wydane: (2018) -
On singleton arc consistency for CSPs defined by monotone patterns
od: Carbonnel, C, i wsp.
Wydane: (2018) -
Tractable classes of binary CSPs defined by excluded topological minors
od: Cohen, D, i wsp.
Wydane: (2015)