{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:32:04Z","timestamp":1750221124836,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T00:00:00Z","timestamp":1554681600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,4,8]]},"DOI":"10.1145\/3297280.3297389","type":"proceedings-article","created":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T12:18:47Z","timestamp":1556713127000},"page":"1117-1122","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Conflict history based search for constraint satisfaction problem"],"prefix":"10.1145","author":[{"given":"Djamal","family":"Habet","sequence":"first","affiliation":[{"name":"Universit\u00e9 de Toulon, Marseille, France"}]},{"given":"Cyril","family":"Terrioux","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Toulon, Marseille, France"}]}],"member":"320","published-online":{"date-parts":[[2019,4,8]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Christian Bessiere Assef Chmeiss and Lakhdar Sais. 2001. Neighborhood-based variable ordering heuristics for the constraint satisfaction problem. In CP. 565--569.","key":"e_1_3_2_1_1_1","DOI":"10.5555\/647488.726978"},{"doi-asserted-by":"publisher","unstructured":"Christian Bessi\u00e8re and Jean-Charles R\u00e9gin. 1996. MAC and Combined Heuristics: Two Reasons to Forsake FC (and CBJ?) on Hard Problems. In CP. 61--75. 10.1007\/3-540-61551-2_66","key":"e_1_3_2_1_2_1","DOI":"10.1007\/3-540-61551-2_66"},{"doi-asserted-by":"publisher","unstructured":"Fr\u00e9d\u00e9ric Boussemart Fred Hemery Christophe Lecoutre and Lakhdar Sa\u00efs. 2004. Boosting Systematic Search by Weighting Constraints. In ECAI. 146--150.","key":"e_1_3_2_1_3_1","DOI":"10.5555\/3000001.3000033"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1145\/359094.359101"},{"doi-asserted-by":"crossref","unstructured":"Niklas E\u00e9n and Niklas S\u00f6rensson. 2003. An Extensible SAT-solver. In SAT. 502--518.","key":"e_1_3_2_1_5_1","DOI":"10.1007\/978-3-540-24605-3_37"},{"doi-asserted-by":"publisher","unstructured":"Pieter A. Geelen. 1992. Dual Viewpoint Heuristics for Binary Constraint Satisfaction Problems. In ECAI. 31--35.","key":"e_1_3_2_1_6_1","DOI":"10.5555\/145448.145491"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1145\/321296.321300"},{"key":"e_1_3_2_1_8_1","first-page":"263","article-title":"Increasing tree search efficiency for constraint satisfaction problems","volume":"14","author":"Haralick Robert M.","year":"1980","unstructured":"Robert M. Haralick and Gordon L. Elliot. 1980. Increasing tree search efficiency for constraint satisfaction problems. AIJ 14 (1980), 263--313.","journal-title":"AIJ"},{"doi-asserted-by":"crossref","unstructured":"Emmanuel Hebrard and Mohamed Siala. 2017. Explanation-Based Weighted Degree. In CPAIOR. 167--175.","key":"e_1_3_2_1_9_1","DOI":"10.1007\/978-3-319-59776-8_13"},{"doi-asserted-by":"crossref","unstructured":"Philippe J\u00e9gou Hanan Kanso and Cyril Terrioux. 2016. Towards a Dynamic Decomposition of CSPs with Separators of Bounded Size. In CP. 298--315.","key":"e_1_3_2_1_10_1","DOI":"10.1007\/978-3-319-44953-1_20"},{"unstructured":"Philippe J\u00e9gou Hanan Kanso and Cyril Terrioux. 2017. BTD and miniBTD. In XCSP3 Competition.","key":"e_1_3_2_1_11_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1016\/S0004-3702(02)00400-9"},{"doi-asserted-by":"publisher","unstructured":"Christophe Lecoutre Lakhdar Sais S\u00e9bastien Tabary and Vincent Vidal. 2007. Nogood Recording from Restarts. In IJCAI. 131--136.","key":"e_1_3_2_1_13_1","DOI":"10.5555\/1625275.1625295"},{"key":"e_1_3_2_1_14_1","first-page":"3","article-title":"Recording and Minimizing Nogoods from Restarts","volume":"1","author":"Lecoutre Christophe","year":"2007","unstructured":"Christophe Lecoutre, Lakhdar Sa\u00efs, S\u00e9bastien Tabary, and Vincent Vidal. 2007. Recording and Minimizing Nogoods from Restarts. JSAT 1, 3--4 (2007), 147--167.","journal-title":"JSAT"},{"doi-asserted-by":"publisher","unstructured":"Jia Hui Liang Vijay Ganesh Pascal Poupart and Krzysztof Czarnecki. 2016. Exponential Recency Weighted Average Branching Heuristic for SAT Solvers. In AAAI. 3434--3440.","key":"e_1_3_2_1_15_1","DOI":"10.5555\/3016100.3016385"},{"doi-asserted-by":"crossref","unstructured":"Jia Hui Liang Vijay Ganesh Pascal Poupart and Krzysztof Czarnecki. 2016. Learning Rate Based Branching Heuristic for SAT Solvers. In SAT. 123--140.","key":"e_1_3_2_1_16_1","DOI":"10.1007\/978-3-319-40970-2_9"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1109\/12.769433"},{"doi-asserted-by":"publisher","unstructured":"Laurent Michel and Pascal Van Hentenryck. 2012. Activity-based search for black-box constraint programming solvers. In CPAIOR. 228--243. 10.1007\/978-3-642-29828-8_15","key":"e_1_3_2_1_18_1","DOI":"10.1007\/978-3-642-29828-8_15"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1145\/378239.379017"},{"doi-asserted-by":"publisher","unstructured":"Philippe Refalo. 2004. Impact-based search strategies for constraint programming. In CP. 557--571. 10.1007\/978-3-540-30201-8_41","key":"e_1_3_2_1_20_1","DOI":"10.1007\/978-3-540-30201-8_41"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.5555\/1207782"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.5555\/3070217.3070242"},{"volume-title":"Modeling and Programming with Gecode, Christian Schulte, Guido Tack, and Mikael Z","author":"Schulte Christian","unstructured":"Christian Schulte. 2018. Programming branchers. In Modeling and Programming with Gecode, Christian Schulte, Guido Tack, and Mikael Z. Lagerkvist (Eds.). Corresponds to Gecode 6.0.1.","key":"e_1_3_2_1_23_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.5555\/551283"}],"event":{"sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"acronym":"SAC '19","name":"SAC '19: The 34th ACM\/SIGAPP Symposium on Applied Computing","location":"Limassol Cyprus"},"container-title":["Proceedings of the 34th ACM\/SIGAPP Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3297280.3297389","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3297280.3297389","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:02:15Z","timestamp":1750208535000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3297280.3297389"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,8]]},"references-count":24,"alternative-id":["10.1145\/3297280.3297389","10.1145\/3297280"],"URL":"https:\/\/doi.org\/10.1145\/3297280.3297389","relation":{},"subject":[],"published":{"date-parts":[[2019,4,8]]},"assertion":[{"value":"2019-04-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}