A compressed Generalized Hypertree Decomposition-based solving technique for non-binary Constraint Satisfaction Problems

DOI10.3233/AIC-150694zbMath1373.68369OpenAlexW2218651731MaRDI QIDQ4592703

Wassila Aggoune-Mtalaa, Zineb Habbas, Kamal Amroun

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

constraint satisfaction problems (CSP)compression of constraint relationsgeneralized hypertree decomposition (GHD)

Mathematics Subject Classification ID

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

Related Items (3)

HyperBench ⋮ Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems ⋮ Fast and parallel decomposition of constraint satisfaction problems

This page was built for publication: A compressed Generalized Hypertree Decomposition-based solving technique for non-binary Constraint Satisfaction Problems