Generalized Hypertree Decomposition for solving non binary CSP with compressed table constraints
From MaRDI portal
Publication:2805480
DOI10.1051/ro/2015017zbMath1357.68207OpenAlexW2305237467MaRDI QIDQ2805480
Zineb Habbas, Kamal Amroun, Daniel Jeremy Singer
Publication date: 11 May 2016
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ro/2015017
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- STR2: optimized simple tabular reduction for table constraints
- Hypertree decompositions and tractable queries
- Hybrid backtracking bounded by tree-decomposition of constraint networks
- A unified theory of structural tractability for constraint satisfaction problems
- An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints
- Tree clustering for constraint networks
- Constructing optimal binary decision trees is NP-complete
- Decomposing constraint satisfaction problems using database techniques
- Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width.
- A comparison of structural CSP decomposition methods
- Networks of constraints: Fundamental properties and applications to picture processing
- Partition search for non-binary constraint satisfaction
- Generalized hypertree decompositions: NP-hardness and tractable variants
- Constraint solving via fractional edge covers
- Graph minors. II. Algorithmic aspects of tree-width
- A sufficient condition for backtrack-bounded search
- A Sufficient Condition for Backtrack-Free Search
- A backtracking-based algorithm for hypertree decomposition
- Principles and Practice of Constraint Programming – CP 2004
