Proceedings

Tractable Classes of Binary CSPs Defined by Excluded Topological Minors

Download BibTeX Cite

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence. Main Track. Pages 1945-1950.

Abstract

The binary Constraint Satisfaction Problem (CSP) is to decide whether there exists an assignment to a set of variables which satisfies specified constraints between pairs of variables. A CSP instance can be presented as a labelled graph (called the microstructure) encoding both the forms of the constraints and where they are imposed. We consider subproblems defined by restricting the allowed form of the microstructure. One form of restriction that has previously been considered is to forbid certain specified substructures (patterns). This captures some tractable classes of the CSP, but does not capture the well-known property of acyclicity. In this paper we introduce the notion of a topological minor of a binary CSP instance. By forbidding certain patterns as topological minors we obtain a compact mechanism for expressing several novel tractable classes, including new generalisations of the class of acyclic instances.

David A. Cohen, Martin C. Cooper, Peter Jeavons, and Stanislav Zivný. 2015. Tractable Classes of Binary CSPs Defined by Excluded Topological Minors. In Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI-15. IJCAI, 1945–1950. https://ijcai.org/proceedings/2015/276
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards