{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T11:06:22Z","timestamp":1746529582942,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031157066"},{"type":"electronic","value":"9783031157073"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-15707-3_12","type":"book-chapter","created":{"date-parts":[[2022,8,26]],"date-time":"2022-08-26T11:02:47Z","timestamp":1661511767000},"page":"145-158","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Deep Learning for the Generation of Heuristics in Answer Set Programming: A Case Study of Graph Coloring"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5617-5286","authenticated-orcid":false,"given":"Carmine","family":"Dodaro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5111-8998","authenticated-orcid":false,"given":"Davide","family":"Ilardi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8445-395X","authenticated-orcid":false,"given":"Luca","family":"Oneto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8218-3178","authenticated-orcid":false,"given":"Francesco","family":"Ricca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,29]]},"reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-319-23264-5_5","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Alviano","year":"2015","unstructured":"Alviano, M., Dodaro, C., Leone, N., Ricca, F.: Advances in WASP. In: Calimeri, F., Ianni, G., Truszczynski, M. (eds.) LPNMR 2015. LNCS (LNAI), vol. 9345, pp. 40\u201354. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23264-5_5"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-319-23264-5_6","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"B Andres","year":"2015","unstructured":"Andres, B., Biewer, A., Romero, J., Haubelt, C., Schaub, T.: Improving coordinated SMT-based system synthesis by utilizing domain-specific heuristics. In: Calimeri, F., Ianni, G., Truszczynski, M. (eds.) LPNMR 2015. LNCS (LNAI), vol. 9345, pp. 55\u201368. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23264-5_6"},{"issue":"2","key":"12_CR3","doi-asserted-by":"publisher","first-page":"147","DOI":"10.3233\/AIC-2011-0493","volume":"24","author":"M Balduccini","year":"2011","unstructured":"Balduccini, M.: Learning and using domain-specific heuristics in ASP solvers. AI Commun. 24(2), 147\u2013164 (2011). https:\/\/doi.org\/10.3233\/AIC-2011-0493","journal-title":"AI Commun."},{"issue":"7","key":"12_CR4","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1145\/3448250","volume":"64","author":"Y Bengio","year":"2021","unstructured":"Bengio, Y., LeCun, Y., Hinton, G.E.: Deep learning for AI. Commun. ACM 64(7), 58\u201365 (2021). https:\/\/doi.org\/10.1145\/3448250","journal-title":"Commun. ACM"},{"issue":"12","key":"12_CR5","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/2043174.2043195","volume":"54","author":"G Brewka","year":"2011","unstructured":"Brewka, G., Eiter, T., Truszczynski, M.: Answer set programming at a glance. Commun. ACM 54(12), 92\u2013103 (2011). https:\/\/doi.org\/10.1145\/2043174.2043195","journal-title":"Commun. ACM"},{"issue":"2","key":"12_CR6","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1017\/S1471068418000546","volume":"20","author":"F Calimeri","year":"2020","unstructured":"Calimeri, F., Dodaro, C., Fusc\u00e0, D., Perri, S., Zangari, J.: Efficiently coupling the I-DLV grounder with ASP solvers. TPLP 20(2), 205\u2013224 (2020). https:\/\/doi.org\/10.1017\/S1471068418000546","journal-title":"TPLP"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.artint.2015.09.008","volume":"231","author":"F Calimeri","year":"2016","unstructured":"Calimeri, F., Gebser, M., Maratea, M., Ricca, F.: Design and results of the fifth answer set programming competition. Artif. Intell. 231, 151\u2013181 (2016). https:\/\/doi.org\/10.1016\/j.artint.2015.09.008","journal-title":"Artif. Intell."},{"issue":"5\u20136","key":"12_CR8","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1017\/S1471068416000284","volume":"16","author":"C Dodaro","year":"2016","unstructured":"Dodaro, C., Gasteiger, P., Leone, N., Musitsch, B., Ricca, F., Schekotihin, K.: Combining answer set programming and domain heuristics for solving hard industrial problems (application paper). TPLP 16(5\u20136), 653\u2013669 (2016). https:\/\/doi.org\/10.1017\/S1471068416000284","journal-title":"TPLP"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502\u2013518. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24605-3_37"},{"issue":"3","key":"12_CR10","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1609\/aimag.v37i3.2678","volume":"37","author":"E Erdem","year":"2016","unstructured":"Erdem, E., Gelfond, M., Leone, N.: Applications of answer set programming. AI Mag. 37(3), 53\u201368 (2016). https:\/\/doi.org\/10.1609\/aimag.v37i3.2678","journal-title":"AI Mag."},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Gebser, M., Kaufmann, B., Romero, J., Otero, R., Schaub, T., Wanko, P.: Domain-specific heuristics in answer set programming. In: Proceedings of AAAI. AAAI Press (2013)","DOI":"10.1609\/aaai.v27i1.8585"},{"key":"12_CR12","unstructured":"Goodfellow, I., Bengio, Y., Courville, A.: Deep Learning. MIT Press, Cambridge (2016)"},{"issue":"1","key":"12_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1021\/ci0342472","volume":"44","author":"DM Hawkins","year":"2004","unstructured":"Hawkins, D.M.: The problem of overfitting. J. Chem. Inf. Comput. Sci. 44(1), 1\u201312 (2004)","journal-title":"J. Chem. Inf. Comput. Sci."},{"issue":"4\u20135","key":"12_CR14","first-page":"569","volume":"14","author":"HH Hoos","year":"2014","unstructured":"Hoos, H.H., Lindauer, M., Schaub, T.: claspfolio 2: advances in algorithm selection for answer set programming. TPLP 14(4\u20135), 569\u2013585 (2014)","journal-title":"TPLP"},{"issue":"5","key":"12_CR15","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/0893-6080(89)90020-8","volume":"2","author":"K Hornik","year":"1989","unstructured":"Hornik, K., Stinchcombe, M.B., White, H.: Multilayer feedforward networks are universal approximators. Neural Netw. 2(5), 359\u2013366 (1989)","journal-title":"Neural Netw."},{"issue":"3","key":"12_CR16","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1609\/aimag.v37i3.2672","volume":"37","author":"B Kaufmann","year":"2016","unstructured":"Kaufmann, B., Leone, N., Perri, S., Schaub, T.: Grounding and solving in answer set programming. AI Mag. 37(3), 25\u201332 (2016). https:\/\/doi.org\/10.1609\/aimag.v37i3.2672","journal-title":"AI Mag."},{"key":"12_CR17","unstructured":"Kingma, D.P., Ba, J.: Adam: a method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014)"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-319-94144-8_6","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2018","author":"JH Liang","year":"2018","unstructured":"Liang, J.H., Oh, C., Mathew, M., Thomas, C., Li, C., Ganesh, V.: Machine learning-based restart policy for CDCL SAT solvers. In: Beyersdorff, O., Wintersteiger, C.M. (eds.) SAT 2018. LNCS, vol. 10929, pp. 94\u2013110. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94144-8_6"},{"issue":"6","key":"12_CR19","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1017\/S1471068413000094","volume":"14","author":"M Maratea","year":"2014","unstructured":"Maratea, M., Pulina, L., Ricca, F.: A multi-engine approach to answer-set programming. TPLP 14(6), 841\u2013868 (2014). https:\/\/doi.org\/10.1017\/S1471068413000094","journal-title":"TPLP"},{"key":"12_CR20","series-title":"Modeling and Optimization in Science and Technologies","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-24359-3","volume-title":"Model Selection and Error Estimation in a Nutshell","author":"L Oneto","year":"2020","unstructured":"Oneto, L.: Model Selection and Error Estimation in a Nutshell. MOST, vol. 15. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-24359-3"},{"issue":"6088","key":"12_CR21","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1038\/323533a0","volume":"323","author":"D Rumelhart","year":"1986","unstructured":"Rumelhart, D., Hinton, G., Williams, R.: Learning representations by back-propagating errors. Nature 323(6088), 533\u2013536 (1986)","journal-title":"Nature"},{"key":"12_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":"12_CR23","doi-asserted-by":"crossref","unstructured":"Shalev-Shwartz, S., Ben-David, S.: Understanding Machine Learning: From Theory to Algorithms. Cambridge University Press, Cambridge (2014)","DOI":"10.1017\/CBO9781107298019"},{"key":"12_CR24","unstructured":"Taupe, R., Friedrich, G., Schekotihin, K., Weinzierl, A.: Solving configuration problems with ASP and declarative domain specific heuristics. In: Proceedings of CWS\/ConfWS, vol. 2945, pp. 13\u201320. CEUR-WS.org (2021)"},{"key":"12_CR25","doi-asserted-by":"crossref","unstructured":"Wu, H.: Improving sat-solving with machine learning. In: Proceedings of SIGCSE, pp. 787\u2013788. ACM (2017)","DOI":"10.1145\/3017680.3022464"},{"key":"12_CR26","unstructured":"Xu, L., Hoos, H.H., Leyton-Brown, K.: Predicting satisfiability at the phase transition. In: Proceedings of AAAI. AAAI Press (2012)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15707-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,25]],"date-time":"2022-11-25T21:32:35Z","timestamp":1669411955000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15707-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031157066","9783031157073"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15707-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LPNMR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Logic Programming and Nonmonotonic Reasoning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Genoa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lpnmr2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lpnmr2022.dibris.unige.it\/","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":"57","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":"34","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":"5","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":"60% - 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":"3","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)"}}]}}