Volume 50, Number 2, April-June 2016
Special issue: Research on Optimization and Graph Theory dedicated to COSI 2013
|Page(s)||241 - 267|
|Published online||21 March 2016|
Generalized Hypertree Decomposition for solving non binary CSP with compressed table constraints∗
1 LCOMS EA 7306, University of Lorraine, Metz, France.
2 LIMED, Faculté des Sciences Exactes, Université de Bejaia, 06000 Bejaia, Algeria.
Accepted: 1 June 2015
Many real-world problems can be modelled as Constraint Satisfaction Problems (CSPs). Although CSP is NP-complete, it has been proved that non binary CSP instances may be efficiently solved if they are representable as Generalized Hypertree Decomposition (GHD) with small width. Algorithms for solving CSPs based on a GHD consider an extensional representation of constraints together with join and semi-join operations giving rise to new large constraint tables (or relations) needed to be temporarily saved. Extensional representation of constraints is quite natural and adapted to the specification of real problems but unfortunately limits significantly the practical performance of these algorithms. The present work tackles this problem using a compact representation of constraint tables. Consequently, to make algorithms compatible with this compact representation, new “compressed join” and “compressed semi-join” operations have to be defined. This last step constitutes our main contribution which, as far as we know, has never been presented. The correctness of this approach is proved and validated on multiple benchmarks. Experimental results show that using compressed relations and compressed operations improves significantly the practical performance of the basic algorithm proposed by Gottlob et al. for solving non binary CSPs with a Generalized Hypertree Decomposition.
Mathematics Subject Classification: 68T20
Key words: Constraint Satisfaction Problems / Generalized Hypertree Decomposition / compressed table constraints
© EDP Sciences, ROADEF, SMAI 2016
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.