Abstract
Novel tractable classes of the binary CSP (constraint satisfaction problem) have recently been discovered by studying classes of instances defined by excluding subproblems described by patterns. The complete characterisation of all tractable classes defined by forbidden patterns is a challenging problem. We demonstrate a dichotomy in the case of forbidden patterns consisting of two constraints.
Cite
CITATION STYLE
APA
Cooper, M. C., & Escamocher, G. (2012). A Dichotomy for 2-Constraint Forbidden CSP Patterns. In Proceedings of the 26th AAAI Conference on Artificial Intelligence, AAAI 2012 (pp. 464–470). AAAI Press. https://doi.org/10.1609/aaai.v26i1.8131
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free