{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T05:41:55Z","timestamp":1688190115809},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"13","license":[{"start":{"date-parts":[[2022,12,27]],"date-time":"2022-12-27T00:00:00Z","timestamp":1672099200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,27]],"date-time":"2022-12-27T00:00:00Z","timestamp":1672099200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2023,7]]},"DOI":"10.1007\/s10489-022-04361-y","type":"journal-article","created":{"date-parts":[[2022,12,27]],"date-time":"2022-12-27T12:02:50Z","timestamp":1672142570000},"page":"17226-17239","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["HSJ-Solver: a new method based on GHD for answering conjunctive queries and solving constraint satisfaction problems"],"prefix":"10.1007","volume":"53","author":[{"given":"Zineb","family":"Younsi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kamal","family":"Amroun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Farida","family":"Bouarab-Dahmani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sofia","family":"Bennai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,27]]},"reference":[{"key":"4361_CR1","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1006\/jcss.2000.1713","volume":"61","author":"G Phokion","year":"2000","unstructured":"Phokion G, Moshe Y (2000) Conjunctive-Query containment and constraint satisfaction. J Comput Syst Sci 61:302\u2013332","journal-title":"J Comput Syst Sci"},{"key":"4361_CR2","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N Robertson","year":"1986","unstructured":"Robertson N, Seymour P D (1986) Graph minors.ii. algorithmic aspects of treewidth. J Algorithms 7:309\u2013322","journal-title":"J Algorithms"},{"key":"4361_CR3","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0004-3702(94)90003-5","volume":"66","author":"M Gyssens","year":"1994","unstructured":"Gyssens M, Jeavons P, Cohen D A (1994) Decomposing constraint satisfaction problems using database techniques. Artif Intell 66:57\u201389","journal-title":"Artif Intell"},{"key":"4361_CR4","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/S0004-3702(00)00078-3","volume":"124","author":"G Gottlob","year":"2000","unstructured":"Gottlob G, Leone N, Scarcello F (2000) A comparison of structural CSP decomposition methods. Artif Intell 124:243\u2013282","journal-title":"Artif Intell"},{"key":"4361_CR5","unstructured":"Cohen DA, Jeavons P, Gyssens M (2005) A unified theory of structural tractability for constraint satisfaction and spread cut decomposition. In: Proceedings of the 19th international joint conference on artificial intelligence, pp 72-77"},{"key":"4361_CR6","doi-asserted-by":"crossref","unstructured":"Adler I, Gottlob G, Grohe M (2005) Hypertree width and related hypergraph invariants. In: The 3rd European conference on combinatorics, graph theory and applications (EuroComb 05), pp 5\u201310","DOI":"10.46298\/dmtcs.3424"},{"key":"4361_CR7","doi-asserted-by":"crossref","unstructured":"Grohe M, Marx D (2006) Constraint solving via fractional edge covers. In: Proceedings of SODA 2006, pp 289-298","DOI":"10.1145\/1109557.1109590"},{"key":"4361_CR8","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1051\/ro\/2015017","volume":"50","author":"Z Habbas","year":"2016","unstructured":"Habbas Z, Amroun K, Singer D (2016) Generalized Hypertree Decomposition for solving non binary CSP with compressed table constraints. RAIRO J 50:241\u2013267","journal-title":"RAIRO J"},{"issue":"2","key":"4361_CR9","doi-asserted-by":"publisher","first-page":"371","DOI":"10.3233\/AIC-150694","volume":"29","author":"K Amroun","year":"2016","unstructured":"Amroun K, Habbas Z, Aggoune-Mtalaa W (2016) A compressed generalized hypertree decomposition-based solving technique for non binary constraint satisfaction problems. AI Communications J 29(2):371\u2013392","journal-title":"AI Communications J"},{"key":"4361_CR10","unstructured":"Abiteboul S, Hull R, Vianu V (1995) FoundationsofDatabases. Addison-Wesley Reading"},{"key":"4361_CR11","unstructured":"Ullman J D (1989) Principles of Database and Knowledge Base Systems, Computer Science Press. 1 edition"},{"key":"4361_CR12","unstructured":"Yannakakis M (1981) Algorithms for Acyclic Database Schemes. In: Proceedings of Very Large Data Bases\u201981. pp 82-92"},{"key":"4361_CR13","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1145\/2402.322390","volume":"30","author":"R Fagin","year":"1983","unstructured":"Fagin R (1983) Degrees of acyclicity for hypergraphs and relational database schemes. J ACM. 30:514\u2013550","journal-title":"J ACM."},{"key":"4361_CR14","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1145\/2402.322389","volume":"30","author":"C Beeri","year":"1983","unstructured":"Beeri C, Fagin R, Maier D, Yannakakis M (1983) On the desirability of Acyclic database schemes. J ACM 30:479\u2013513","journal-title":"J ACM"},{"key":"4361_CR15","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0020-0255(74)90008-5","volume":"7","author":"U Montanari","year":"1974","unstructured":"Montanari U (1974) Networks of constraints: Fundamental properties and applications to pictures processing. Inform Sci 7:95\u2013132","journal-title":"Inform Sci"},{"key":"4361_CR16","unstructured":"Maier D (1986) The theory of relational databases rochville. Md. Computer Science Press"},{"key":"4361_CR17","unstructured":"Marc H G (1979) On the universal relation. Technical report, University of Toronto"},{"issue":"4","key":"4361_CR18","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1137\/0210059","volume":"10","author":"PA Bernstein","year":"1981","unstructured":"Bernstein PA, Goodman N (1981) The power of natural semijoins. SIAM J Comput 10 (4):751\u2013771","journal-title":"SIAM J Comput"},{"key":"4361_CR19","doi-asserted-by":"crossref","unstructured":"Gottlob G, Grohe M, Musliu N, Samer M, Scarcello F (2005) Hypertree decomposition: structure, algorithms and applications. In: Conference: Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science. pp 1-15","DOI":"10.1007\/11604686_1"},{"key":"4361_CR20","doi-asserted-by":"crossref","unstructured":"Gottlob G, Leone N, Scarcello F (1999) On tractable queries and constraints. In: Proceedings of the 10th international conference on database and expert systems applications. pp 1\u201315","DOI":"10.1007\/3-540-48309-8_1"},{"key":"4361_CR21","doi-asserted-by":"crossref","unstructured":"Gottlob G, Samer M (2009) A Backtracking-Based Algorithm for hypertree decomposition. ACM Journal of Experimental Algorithmics (JEA), 13","DOI":"10.1145\/1412228.1412229"},{"key":"4361_CR22","doi-asserted-by":"crossref","unstructured":"Dermaku A, Ganzow T, Gottlob G, McMahan B, Musliu N, Samer M (2008) Heuristic Methods for hypertree decompositions. In: Proceeding of the 7th Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence. pp 1-11","DOI":"10.1007\/978-3-540-88636-5_1"},{"key":"4361_CR23","unstructured":"Noll LC, Fowler G, Vo P, Hash FNV http:\/\/www.isthe.com\/chongo\/tech\/comp\/fnv\/index.html Accessed on august 21, 19"},{"key":"4361_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2014.12.002","volume":"220","author":"C Lecoutre","year":"2015","unstructured":"Lecoutre C, Likitvivatanavong C, Roland H C (2015) STR3: A path-optimal filtering algorithm for table constraints. Artif Intell 220:1\u201327","journal-title":"Artif Intell"},{"key":"4361_CR25","doi-asserted-by":"crossref","unstructured":"Demeulenaere J, Hartert R, Lecoutre C, Perez G, Perron L, R\u00e9gin JC, Schaus P (2016) Compact-table: efficiently filtering table constraints with reversible sparse bit-sets. In: Poceedings of the 22th international conference on principles and practice of constraint programming. pp 207-223","DOI":"10.1007\/978-3-319-44953-1_14"},{"key":"4361_CR26","unstructured":"IMDB (2022) http:\/\/imdb.com Accessed on July 22, 2022"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-04361-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-022-04361-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-04361-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T05:17:29Z","timestamp":1688188649000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-022-04361-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,27]]},"references-count":26,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["4361"],"URL":"https:\/\/doi.org\/10.1007\/s10489-022-04361-y","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,27]]},"assertion":[{"value":"24 November 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 December 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}