Skip to Main content Skip to Navigation
Conference papers

Combined Strategies for Decomposition-based Methods for solving CSPs

Abstract : In this paper, we consider theoretical and practical methods based on decompositions of constraint networks. We exploit the fact that decomposition-based methods can be used considering two steps. The first step is related to the (hyper)graphical decomposition (e.g. Tree-Decomposition [Robertson and Seymour, 1986] or Hypertree-Decomposition [Gottlob, Leone and Scarcello, 2000]) while the second step exploits the decomposition to solve the CSPs. Thanks to this approach, we define then hybrid methods which can be optimal from a theoretical viewpoint while being efficient in practice. The complexity analysis of these combined methods allows us to give a more detailed presentation of the Constraint Tractability Hierarchy introduced in [Gottlob, Leone and Scarcello, 2000]. Finally, we justify our approach with experimental results.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01437772
Contributor : Équipe Gestionnaire Des Publications Si Liris <>
Submitted on : Tuesday, January 17, 2017 - 1:58:52 PM
Last modification on : Monday, March 30, 2020 - 8:54:59 AM

Identifiers

Citation

Philippe Jégou, Samba Ndojh Ndiaye, Cyril Terrioux. Combined Strategies for Decomposition-based Methods for solving CSPs. 21st International Conference on Tools with Artificial Intelligence (ICTAI'09), Nov 2009, Newark (New Jersey), United States. pp.184-192, ⟨10.1109/ICTAI.2009.70⟩. ⟨hal-01437772⟩

Share

Metrics

Record views

349