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...
| Huvudupphovsmän: | , |
|---|---|
| Materialtyp: | Conference item |
| Publicerad: |
Association for Computing Machinery
2016
|