{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:27Z","timestamp":1760202687003,"version":"3.41.0"},"reference-count":24,"publisher":"SAGE Publications","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AIC"],"published-print":{"date-parts":[[2016,3,2]]},"DOI":"10.3233\/aic-150694","type":"journal-article","created":{"date-parts":[[2016,3,4]],"date-time":"2016-03-04T14:38:32Z","timestamp":1457102312000},"page":"371-392","source":"Crossref","is-referenced-by-count":17,"title":["A compressed Generalized Hypertree Decomposition-based solving technique for non-binary Constraint Satisfaction Problems"],"prefix":"10.1177","volume":"29","author":[{"given":"Kamal","family":"Amroun","sequence":"first","affiliation":[{"name":"LIMED, Facult\u00e9 des Sciences Exactes, Universit\u00e9 de Bejaia, 06000, Algeria. E-mail:\u00a0k_amroun25@yahoo.fr"}]},{"given":"Zineb","family":"Habbas","sequence":"additional","affiliation":[{"name":"University of Lorraine, Metz, France"}]},{"given":"Wassila","family":"Aggoune-Mtalaa","sequence":"additional","affiliation":[{"name":"Luxembourg Institute of Science and Technology, Luxembourg"}]}],"member":"179","reference":[{"doi-asserted-by":"crossref","unstructured":"[1]I.\u00a0Adler, G.\u00a0Gottlob and M.\u00a0Grohe, Hypertree-width and related hypergraph invariants, in: Proceedings of the 3rd European Conference on Combinatorics, Graph Theory, and Applications (EUROCOMB\u201905), DMTCS Proceedings Series, Vol.\u00a0AE, 2005, pp.\u00a05\u201310.","key":"10.3233\/AIC-150694_ref1","DOI":"10.46298\/dmtcs.3424"},{"issue":"3","key":"10.3233\/AIC-150694_ref2","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1145\/2402.322389","article-title":"On the desirability of acyclic database schemes","volume":"30","author":"Beeri","year":"1983","journal-title":"J. ACM"},{"issue":"4","key":"10.3233\/AIC-150694_ref3","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1137\/0210059","article-title":"Power of natural semijoins","volume":"10","author":"Bernstein","year":"1981","journal-title":"SIAM. J. Comput."},{"key":"10.3233\/AIC-150694_ref4","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/0004-3702(89)90037-4","article-title":"Tree clustering for constraint networks","volume":"38","author":"Dechter","year":"1989","journal-title":"Artificial Intelligence"},{"key":"10.3233\/AIC-150694_ref6","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1145\/4221.4225","article-title":"A sufficient condition for backtrack-bounded search","volume":"32","author":"Freuder","year":"1985","journal-title":"Journal of the Association for Computing Machinery"},{"doi-asserted-by":"crossref","unstructured":"[7]G.\u00a0Gottlob, N.\u00a0Leone and F.\u00a0Scarcello, On tractable queries and constraints, in: Proceedings of DEXA\u201999, 1999.","key":"10.3233\/AIC-150694_ref7","DOI":"10.1007\/3-540-48309-8_1"},{"issue":"2","key":"10.3233\/AIC-150694_ref8","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/S0004-3702(00)00078-3","article-title":"A comparison of structural CSP decomposition methods","volume":"124","author":"Gottlob","year":"2000","journal-title":"Artificial Intelligence"},{"key":"10.3233\/AIC-150694_ref9","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1016\/S0022-0000(03)00030-8","article-title":"Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width","volume":"66","author":"Gottlob","year":"2003","journal-title":"Journal of Computer and System Sciences"},{"doi-asserted-by":"crossref","unstructured":"[10]G.\u00a0Gottlob and M.\u00a0Samer, A backtracking-based algorithm for computing hypertree decompositions, ACM Journal of Experimental Algorithmics (JEA) 13 (2008), 1.","key":"10.3233\/AIC-150694_ref10","DOI":"10.1145\/1412228.1412229"},{"doi-asserted-by":"crossref","unstructured":"[11]M.\u00a0Grohe and D.\u00a0Marx, Constraint solving via fractional edge covers, in: Proceedings of SODA, 2006, pp.\u00a0289\u2013298.","key":"10.3233\/AIC-150694_ref11","DOI":"10.1145\/1109557.1109590"},{"key":"10.3233\/AIC-150694_ref12","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0004-3702(94)90003-5","article-title":"Decomposing constraint satisfaction problems using database techniques","volume":"66","author":"Gyssens","year":"1994","journal-title":"Artificial Intelligence"},{"issue":"5","key":"10.3233\/AIC-150694_ref13","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1080\/0952813X.2014.993507","article-title":"A Forward-Checking algorithm based on a Generalised Hypertree Decomposition for solving non-binary constraint satisfaction problems","volume":"27","author":"Habbas","year":"2015","journal-title":"Journal of Experimental and Theoretical Artificial Intelligence"},{"doi-asserted-by":"crossref","unstructured":"[15]P.\u00a0Harvey and A.\u00a0Ghose, Reducing redundancy in the hypertree decomposition scheme, in: Proceeding of ICTAI\u201903, 2003, pp.\u00a0474\u2013481.","key":"10.3233\/AIC-150694_ref15","DOI":"10.1109\/TAI.2003.1250227"},{"key":"10.3233\/AIC-150694_ref16","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0020-0190(76)90095-8","article-title":"Constructing optimal binary decision trees is NP-complete","volume":"5","author":"Hyafil","year":"1976","journal-title":"Information Processing Letters"},{"key":"10.3233\/AIC-150694_ref17","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0004-3702(02)00400-9","article-title":"Hybrid backtracking bounded by tree-decomposition of constraint networks","volume":"146","author":"J\u00e9gou","year":"2003","journal-title":"Artificial Intelligence"},{"doi-asserted-by":"crossref","unstructured":"[18]G.\u00a0Katsirelos and T.\u00a0Walsh, A compression algorithm for large arity extensional constraints, in: Proceedings of CP\u201907, 2007, pp.\u00a0379\u2013393.","key":"10.3233\/AIC-150694_ref18","DOI":"10.1007\/978-3-540-74970-7_28"},{"unstructured":"[20]D.\u00a0Maier, The Theory of Relational Database, Computer Science Press, Rockville, 1983.","key":"10.3233\/AIC-150694_ref20"},{"key":"10.3233\/AIC-150694_ref23","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0020-0255(74)90008-5","article-title":"Networks of constraints: Fundamental properties and applications to pictures processing","volume":"7","author":"Montanari","year":"1974","journal-title":"Information Sciences"},{"issue":"3","key":"10.3233\/AIC-150694_ref24","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1504\/EJIE.2007.014690","article-title":"Genetic algorithms for generalised hypertree decompositions","volume":"1","author":"Musliu","year":"2007","journal-title":"European Journal of Industrial Engineering"},{"doi-asserted-by":"crossref","unstructured":"[25]W.\u00a0Pang and S.D.\u00a0Goodwin, A graph based backtracking algorithm for solving general CSPs, in: Advances in Artificial Intelligence, Lecture Notes in Computer Sciences, Vol.\u00a02671, 2003, pp.\u00a0114\u2013128.","key":"10.3233\/AIC-150694_ref25","DOI":"10.1007\/3-540-44886-1_11"},{"issue":"3","key":"10.3233\/AIC-150694_ref26","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","article-title":"Graph minors. II. Algorithmic aspects of treewidth","volume":"7","author":"Robertson","year":"1986","journal-title":"Journal of Algorithms"},{"unstructured":"[27]M.\u00a0Samer, Hypertree-decomposition via branch-decomposition, in: Proceedings of the 19th International Joint\u00a0Conference on Artificial Intelligence, 2005, pp.\u00a01535\u20131536.","key":"10.3233\/AIC-150694_ref27"},{"unstructured":"[28]S.\u00a0Subbarayan and H.R.\u00a0Anderson, Backtracking procedures for hypertree, hyperspread and connected hypertree decomposition of CSPs, in: Proceedings of IJCAI07, 2007.","key":"10.3233\/AIC-150694_ref28"},{"unstructured":"[29]M.\u00a0Yannakakis, Algorithms for acyclic database schemes, in: Proceedings of VLDB\u201981, C.\u00a0Zaniolo and C.\u00a0Delobel, eds, Cannes, France, 1981, pp.\u00a082\u201394.","key":"10.3233\/AIC-150694_ref29"}],"container-title":["AI Communications"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/AIC-150694","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T16:44:49Z","timestamp":1748796289000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/AIC-150694"}},"subtitle":[],"editor":[{"given":"Toni","family":"Mancini","sequence":"additional","affiliation":[]},{"given":"Marco","family":"Maratea","sequence":"additional","affiliation":[]},{"given":"Francesco","family":"Ricca","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2016,3,2]]},"references-count":24,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.3233\/aic-150694","relation":{},"ISSN":["1875-8452","0921-7126"],"issn-type":[{"type":"electronic","value":"1875-8452"},{"type":"print","value":"0921-7126"}],"subject":[],"published":{"date-parts":[[2016,3,2]]}}}