A compressed generalized hypertree decomposition-based solving technique for non-binary constraint satisfaction problems

DOI10.3233/AIC-150694MaRDI QIDQ4592703zbMATH OpenOpenAlexFDO

Authors Kamal Amroun, Zineb Habbas, Wassila Aggoune-Mtalaa

Publication date 8 November 2017

Published in AI Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/aic-150694

zbMATH Keywords

compression of constraint relationsconstraint satisfaction problems (CSP)generalized hypertree decomposition (GHD)

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Generalized hypertree decomposition for solving non binary CSP with compressed table constraints
• scientific article; zbMATH DE number 2084771
• scientific article; zbMATH DE number 1487978
• On forward checking for non-binary constraint satisfaction.
• scientific article; zbMATH DE number 2243409

Cited in

(6)

• Fast and parallel decomposition of constraint satisfaction problems
• Generalized hypertree decomposition for solving non binary CSP with compressed table constraints
• scientific article; zbMATH DE number 2016110 (Why is no real title available?)
• scientific article; zbMATH DE number 2084771 (Why is no real title available?)
• HyperBench. A benchmark and tool for hypergraphs and empirical findings
• Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems

This page was built for publication: A compressed generalized hypertree decomposition-based solving technique for non-binary constraint satisfaction problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4592703)