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. Forbid- ding patterns (generic sub-instances) provides a means of defining CSP fragments which are neither exclusively language-based...
| প্রধান লেখক: | , |
|---|---|
| বিন্যাস: | Journal article |
| প্রকাশিত: |
IfCoLog (International Federation of Computational Logic)
2017
|