The tractability of CSP classes defined by forbidden patterns

David A. Cohen, Martin C. Cooper, Páidí Creed +1

The constraint satisfaction problem (CSP) is a general problem central to computer science and artificial intelligence. Although the CSP is NP-hard in general, considerable effort…