A Dichotomy for 2-Constraint Forbidden CSP Patterns

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.

• Type: Journal
• Year: 2012
• Where: AAAI
• Authors: Martin C. Cooper, Guillaume Escamocher
• Keywords: AAAI 2012, Characterisation, Constraint Satisfaction Problem, Dichotomy, Intelligent Agents