{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,20]],"date-time":"2025-04-20T18:10:06Z","timestamp":1745172606316,"version":"3.40.4"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031882258","type":"print"},{"value":"9783031882265","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-88226-5_20","type":"book-chapter","created":{"date-parts":[[2025,4,20]],"date-time":"2025-04-20T17:43:20Z","timestamp":1745171000000},"page":"294-305","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["New Heuristic Order Based on\u00a0Tree-Decomposition for\u00a0Solving CSPs"],"prefix":"10.1007","author":[{"given":"Ouali","family":"Lillia","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4259-2783","authenticated-orcid":false,"given":"Amroun","family":"Kamal","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6930-1088","authenticated-orcid":false,"given":"Bezoui","family":"Madani","sequence":"additional","affiliation":[]},{"given":"Younsi","family":"Zineb","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,21]]},"reference":[{"key":"20_CR1","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.: Networks of constraints: fundamental properties and applications to picture processing. Inf. Sci. 7, 95\u2013132 (1974)","journal-title":"Inf. Sci."},{"issue":"6\u20137","key":"20_CR2","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1016\/j.artint.2007.10.016","volume":"172","author":"C Bessiere","year":"2008","unstructured":"Bessiere, C., Stergiou, K., Walsh, T.: Domain filtering consistencies for non-binary constraints. Artif. Intell. 172(6\u20137), 800\u2013822 (2008)","journal-title":"Artif. Intell."},{"key":"20_CR3","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1613\/jair.834","volume":"14","author":"R Debruyne","year":"2001","unstructured":"Debruyne, R., Bessiere, C.: Domain filtering consistencies. J. Artif. Intell. Res. 14, 205\u2013230 (2001)","journal-title":"J. Artif. Intell. Res."},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Janssen, P., J\u00e9gou, P., Nouguier, B., Vilarem, M.C.: A filtering process for general constraint-satisfaction problems: achieving pairwise-consistency using an associated binary representation. In: IEEE International Workshop on Tools for Artificial Intelligence, pp. 420\u2013421. IEEE Computer Society (1989)","DOI":"10.1109\/TAI.1989.65349"},{"key":"20_CR5","unstructured":"J\u00e9gou, P.: On the consistency of general constraint-satisfaction problems. In: Proceedings of the Eleventh National Conference on Artificial Intelligence, pp. 114\u2013119 (1993)"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Karakashian, S., Woodward, R., Reeson, C., Choueiry, B., Bessiere, C.: A first practical algorithm for high levels of relational consistency. In: Proceedings of the AAAI Conference on Artificial Intelligence, pp. 101\u2013107 (2010)","DOI":"10.1609\/aaai.v24i1.7535"},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1613\/jair.3180","volume":"40","author":"C Lecoutre","year":"2011","unstructured":"Lecoutre, C., Cardon, S., Vion, J.: Second-order consistencies. J. Artif. Intell. Res. 40, 175\u2013219 (2011)","journal-title":"J. Artif. Intell. Res."},{"issue":"3","key":"20_CR8","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1145\/210346.210347","volume":"42","author":"P Van Beek","year":"1995","unstructured":"Van Beek, P., Dechter, R.: On the minimality and global consistency of row-convex constraint networks. J. ACM (JACM) 42(3), 543\u2013561 (1995)","journal-title":"J. ACM (JACM)"},{"issue":"4","key":"20_CR9","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1145\/321296.321300","volume":"12","author":"SW Golomb","year":"1965","unstructured":"Golomb, S.W., Baumert, L.D.: Backtrack programming. J. ACM (JACM) 12(4), 516\u2013524 (1965)","journal-title":"J. ACM (JACM)"},{"key":"20_CR10","unstructured":"Gaschnig, J.G.: Performance Measurement and Analysis of Certain Search Algorithms. Carnegie Mellon University (1979)"},{"issue":"3","key":"20_CR11","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/0004-3702(90)90046-3","volume":"41","author":"R Dechter","year":"1990","unstructured":"Dechter, R.: Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition. Artif. Intell. 41(3), 273\u2013312 (1990)","journal-title":"Artif. Intell."},{"issue":"3","key":"20_CR12","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1111\/j.1467-8640.1993.tb00310.x","volume":"9","author":"P Prosser","year":"1993","unstructured":"Prosser, P.: Hybrid algorithms for the constraint satisfaction problem. Comput. Intell. 9(3), 268\u2013299 (1993)","journal-title":"Comput. Intell."},{"issue":"3","key":"20_CR13","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"RM Haralick","year":"1980","unstructured":"Haralick, R.M., Elliott, G.L.: Increasing tree search efficiency for constraint satisfaction problems. Artif. Intell. 14(3), 263\u2013313 (1980)","journal-title":"Artif. Intell."},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Sabin, D., Freuder, E.C.: Contradicting conventional wisdom in constraint satisfaction. In: International Workshop on Principles and Practice of Constraint Programming, pp. 10\u201320. Springer, Heidelberg (1994)","DOI":"10.1007\/3-540-58601-6_86"},{"issue":"2","key":"20_CR15","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.artint.2005.02.004","volume":"165","author":"C Bessiere","year":"2005","unstructured":"Bessiere, C., R\u00e9gin, J.C., Yap, R.H., Zhang, Y.: An optimal coarse-grained arc consistency algorithm. Artif. Intell. 165(2), 165\u2013185 (2005)","journal-title":"Artif. Intell."},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Lecoutre, C., Szymanek, R.: Generalized arc consistency for positive table constraints. In: Principles and Practice of Constraint Programming-CP 2006: 12th International Conference, CP 2006, Nantes, France, 25-29 September 2006. Proceedings 12, pp. 284\u2013298. Springer, Heidelberg (2006)","DOI":"10.1007\/11889205_22"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"J\u00e9gou, P., Kanso, H., Terrioux, C.: Towards a dynamic decomposition of CSPs with separators of bounded size. In: Principles and Practice of Constraint Programming: 22nd International Conference, CP 2016, Toulouse, France, 5-9 September 2016, Proceedings 22, pp. 298-315. Springer International Publishing (2016)","DOI":"10.1007\/978-3-319-44953-1_20"},{"issue":"3","key":"20_CR18","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.: Graph minors. II. algorithmic aspects of tree-width. J. Algorithms 7(3), 309\u201322 (1986)","journal-title":"J. Algorithms"},{"key":"20_CR19","unstructured":"Philippe, J., Cyril, T.: Decomposition and good recording for solving Max-CSPs. Habilitation \u00e0 Diriger des Recherches, 229 (2004)"},{"key":"20_CR20","unstructured":"Wallace, R.J., Freuder, E.C.: Ordering heuristics for arc consistency algorithms. In: Proceedings of the Biennial Conference-Canadian Society for Computational Studies of Intelligence, pp. 163\u2013163. CANADIAN INFORMATION PROCESSING SOCIETY (1992)"}],"container-title":["Communications in Computer and Information Science","Research in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-88226-5_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,20]],"date-time":"2025-04-20T17:43:23Z","timestamp":1745171003000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-88226-5_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031882258","9783031882265"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-88226-5_20","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"21 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CARI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"African Conference on Research in Computer Science and Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beja\u00efa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Algeria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 November 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 November 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cari2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cari-info.org\/call-cari2024-2\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}