Tractable Classes of Binary CSPs Defined by Excluded Topological Minors - Archive ouverte HAL Access content directly
Conference Papers Year : 2015

Tractable Classes of Binary CSPs Defined by Excluded Topological Minors

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.
Fichier principal
Vignette du fichier
cohen_15299.pdf (155.48 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-04079418 , version 1 (24-04-2023)

Identifiers

  • HAL Id : hal-04079418 , version 1
  • OATAO : 15299

Cite

David A. Cohen, Martin Cooper, Peter G. Jeavons, Stanislav Zivny. Tractable Classes of Binary CSPs Defined by Excluded Topological Minors. 24th International Joint Conference on Artificial Intelligence (IJCAI 2015), International Joint Conferences on Artificial Intelligence (IJCAI), Jul 2015, Buenos Aires, Argentina. pp.1945-1951. ⟨hal-04079418⟩
10 View
3 Download

Share

Gmail Facebook X LinkedIn More