{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:57:58Z","timestamp":1742965078272,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030782290"},{"type":"electronic","value":"9783030782306"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-78230-6_4","type":"book-chapter","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T23:06:15Z","timestamp":1623884775000},"page":"62-71","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Learning Variable Activity Initialisation for Lazy Clause Generation Solvers"],"prefix":"10.1007","author":[{"given":"Ronald","family":"van Driel","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1587-5582","authenticated-orcid":false,"given":"Emir","family":"Demirovi\u0107","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1814-3515","authenticated-orcid":false,"given":"Neil","family":"Yorke-Smith","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,17]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Amadini, R., Gabbrielli, M., Mauro, J.: SUNNY-CP: a sequential CP portfolio solver. In: Proceedings of the 30th ACM Symposium on Applied Computing, pp. 1861\u20131867 (2015)","DOI":"10.1145\/2695664.2695741"},{"issue":"2","key":"4_CR2","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.ejor.2020.07.063","volume":"290","author":"Y Bengio","year":"2021","unstructured":"Bengio, Y., Lodi, A., Prouvost, A.: Machine learning for combinatorial optimization: a methodological tour d\u2019Horizon. Eur. J. Oper. Res. 290(2), 405\u2013421 (2021)","journal-title":"Eur. J. Oper. Res."},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-030-19212-9_3","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"J Berg","year":"2019","unstructured":"Berg, J., Demirovi\u0107, E., Stuckey, P.J.: Core-boosted linear search for incomplete MaxSAT. In: Rousseau, L.-M., Stergiou, K. (eds.) CPAIOR 2019. LNCS, vol. 11494, pp. 39\u201356. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-19212-9_3"},{"key":"4_CR4","unstructured":"Chu, G., Stuckey, P.J., Schutt, A., Ehlers, T., Gange, G., Francis, K.: Chuffed, a lazy clause generation solver (2018). https:\/\/github.com\/chuffed\/chuffed"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"De U\u00f1a, D., R\u00fcmmele, N., Gange, G., Schachte, P., Stuckey, P.J.: Machine learning and constraint programming for relational-to-ontology schema mapping. In: Proceedings of IJCAI 2018, pp. 1277\u20131283 (2018)","DOI":"10.24963\/ijcai.2018\/178"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-030-19212-9_16","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"E Demirovi\u0107","year":"2019","unstructured":"Demirovi\u0107, E., et al.: An investigation into prediction + optimisation for the Knapsack problem. In: Rousseau, L.-M., Stergiou, K. (eds.) CPAIOR 2019. LNCS, vol. 11494, pp. 241\u2013257. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-19212-9_16"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Elffers, J., Gocht, S., McCreesh, C., et al.: Justifying all differences using pseudo-boolean reasoning. In: Proceedings of AAAI 2020, pp. 1486\u20131494 (2020)","DOI":"10.1609\/aaai.v34i02.5507"},{"key":"4_CR8","unstructured":"Elmachtoub, A.N., Grigas, P.: Smart \u2018predict, then optimize\u2019. CoRR abs\/1710.08005 (2017). http:\/\/arxiv.org\/abs\/1710.08005"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-319-93031-2_18","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"A Galassi","year":"2018","unstructured":"Galassi, A., Lombardi, M., Mello, P., Milano, M.: Model agnostic solution of CSPs via deep learning: a preliminary study. In: van Hoeve, W.-J. (ed.) CPAIOR 2018. LNCS, vol. 10848, pp. 254\u2013262. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93031-2_18"},{"key":"4_CR10","unstructured":"Gasse, M., Ch\u00e9telat, D., Ferroni, N., Charlin, L., Lodi, A.: Exact combinatorial optimization with graph convolutional neural networks. In: Proceedings of NeurIPS 2019, pp. 15554\u201315566 (2019)"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/978-3-030-58475-7_20","volume-title":"Principles and Practice of Constraint Programming","author":"S Gocht","year":"2020","unstructured":"Gocht, S., McBride, R., McCreesh, C., Nordstr\u00f6m, J., Prosser, P., Trimble, J.: Certifying solvers for clique and maximum common (connected) subgraph problems. In: Simonis, H. (ed.) CP 2020. LNCS, vol. 12333, pp. 338\u2013357. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58475-7_20"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Gocht, S., McCreesh, C., Nordstr\u00f6m, J.: Subgraph isomorphism meets cutting planes: solving with certified solutions. In: Proceedings of IJCAI 2020, pp. 1134\u20131140 (2020)","DOI":"10.24963\/ijcai.2020\/158"},{"key":"4_CR13","unstructured":"Guerri, A., Milano, M.: Learning techniques for automatic algorithm portfolio selection. In: Proceedings of ECAI 2004, pp. 475\u2013479 (2004)"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Khalil, E., Le Bodic, P., Song, L., Nemhauser, G., Dilkina, B.: Learning to branch in mixed integer programming. In: Proceedings of AAAI 2016, pp. 724\u2013731 (2016)","DOI":"10.1609\/aaai.v30i1.10080"},{"key":"4_CR15","unstructured":"Kipf, T.N., Welling, M.: Semi-supervised classification with graph convolutional networks. CoRR abs\/1609.02907 (2016). http:\/\/arxiv.org\/abs\/1609.02907"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-319-59776-8_7","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"K Leo","year":"2017","unstructured":"Leo, K., Tack, G.: Debugging unsatisfiable constraint models. In: Salvagnin, D., Lombardi, M. (eds.) CPAIOR 2017. LNCS, vol. 10335, pp. 77\u201393. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59776-8_7"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-319-26287-1_14","volume-title":"Hardware and Software: Verification and Testing","author":"JH Liang","year":"2015","unstructured":"Liang, J.H., Ganesh, V., Zulkoski, E., Zaman, A., Czarnecki, K.: Understanding VSIDS branching heuristics in conflict-driven clause-learning SAT solvers. In: Piterman, N. (ed.) HVC 2015. LNCS, vol. 9434, pp. 225\u2013241. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-26287-1_14"},{"key":"4_CR18","unstructured":"MiniZinc: The MiniZinc benchmark suite (2016). https:\/\/github.com\/MiniZinc\/minizinc-benchmarks"},{"key":"4_CR19","unstructured":"MiniZinc: Minizinc challenge 2020 (2020). https:\/\/www.minizinc.org\/challenge2020\/results2020.html"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: Proceedings of 38th Annual Design Automation Conference, pp. 530\u2013535 (2001)","DOI":"10.1145\/378239.379017"},{"issue":"3","key":"4_CR21","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s10601-008-9064-x","volume":"14","author":"O Ohrimenko","year":"2009","unstructured":"Ohrimenko, O., Stuckey, P.J., Codish, M.: Propagation via lazy clause generation. Constraints 14(3), 357\u2013391 (2009)","journal-title":"Constraints"},{"key":"4_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-030-24258-9_24","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2019","author":"D Selsam","year":"2019","unstructured":"Selsam, D., Bj\u00f8rner, N.: Guiding high-performance SAT solvers with unsat-core predictions. In: Janota, M., Lynce, I. (eds.) SAT 2019. LNCS, vol. 11628, pp. 336\u2013353. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24258-9_24"},{"key":"4_CR23","unstructured":"Selsam, D., Bj\u00f8rner, N.: Neurocore: guiding high-performance SAT solvers with unsat-core predictions. CoRR abs\/1903.04671 (2019). http:\/\/arxiv.org\/abs\/1903.04671"},{"key":"4_CR24","unstructured":"Song, W., Cao, Z., Zhang, J., Lim, A.: Learning variable ordering heuristics for solving constraint satisfaction problems. CoRR abs\/1912.10762 (2019). http:\/\/arxiv.org\/abs\/1912.10762"},{"key":"4_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-030-24258-9_26","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2019","author":"M Soos","year":"2019","unstructured":"Soos, M., Kulkarni, R., Meel, K.S.: CrystalBall: gazing in the black box of SAT solving. In: Janota, M., Lynce, I. (eds.) SAT 2019. LNCS, vol. 11628, pp. 371\u2013387. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24258-9_26"},{"issue":"2","key":"4_CR26","doi-asserted-by":"publisher","first-page":"150","DOI":"10.3390\/ai2020010","volume":"2","author":"K Yilmaz","year":"2021","unstructured":"Yilmaz, K., Yorke-Smith, N.: A study of learning search approximation in mixed integer branch and bound: node selection in SCIP. AI 2(2), 150\u2013178 (2021). https:\/\/doi.org\/10.3390\/ai2020010","journal-title":"AI"}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-78230-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T12:07:58Z","timestamp":1672488478000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-78230-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030782290","9783030782306"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-78230-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"17 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cpaior2021.dbai.tuwien.ac.at\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"75","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the COVID-19 pandemic the conference was held online.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}