{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:00:18Z","timestamp":1743145218113,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031492983"},{"type":"electronic","value":"9783031492990"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-49299-0_6","type":"book-chapter","created":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T05:06:49Z","timestamp":1703135209000},"page":"77-92","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["GNN Based Extraction of\u00a0Minimal Unsatisfiable Subsets"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-2327-7720","authenticated-orcid":false,"given":"Sota","family":"Moriyama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4603-5252","authenticated-orcid":false,"given":"Koji","family":"Watanabe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2717-9122","authenticated-orcid":false,"given":"Katsumi","family":"Inoue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,22]]},"reference":[{"issue":"1","key":"6_CR1","first-page":"3649","volume":"14","author":"J Ahlgren","year":"2013","unstructured":"Ahlgren, J., Yuen, S.Y.: Efficient program synthesis using constraint satisfaction in inductive logic programming. J. Mach. Learn. Res. 14(1), 3649\u20133682 (2013)","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"6_CR2","doi-asserted-by":"publisher","first-page":"97","DOI":"10.3233\/AIC-2012-0523","volume":"25","author":"A Belov","year":"2012","unstructured":"Belov, A., Lynce, I., Marques-Silva, J.: Towards efficient MUS extraction. AI Commun. 25(2), 97\u2013116 (2012)","journal-title":"AI Commun."},{"issue":"1","key":"6_CR3","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/s44196-022-00139-9","volume":"15","author":"W Chang","year":"2022","unstructured":"Chang, W., Zhang, H., Luo, J.: Predicting propositional satisfiability based on graph attention networks. Int. J. Comput. Intell. Syst. 15(1), 84 (2022)","journal-title":"Int. J. Comput. Intell. Syst."},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, pp. 151\u2013158. ACM (1971)","DOI":"10.1145\/800157.805047"},{"issue":"1","key":"6_CR5","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s10994-021-06089-1","volume":"111","author":"A Cropper","year":"2022","unstructured":"Cropper, A., Dumancic, S., Evans, R., Muggleton, S.H.: Inductive logic programming at 30. Mach. Learn. 111(1), 147\u2013172 (2022)","journal-title":"Mach. Learn."},{"key":"6_CR6","unstructured":"Gilmer, J., Schoenholz, S.S., Riley, P.F., Vinyals, O., Dahl, G.E.: Neural message passing for quantum chemistry. In: Proceedings of the 34th International Conference on Machine Learning, vol. 70, pp. 1263\u20131272. PMLR (2017)"},{"issue":"3","key":"6_CR7","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10601-007-9019-7","volume":"12","author":"\u00c9 Gr\u00e9goire","year":"2007","unstructured":"Gr\u00e9goire, \u00c9., Mazure, B., Piette, C.: Local-search extraction of MUSes. Constraints Ann. Int. J. 12(3), 325\u2013344 (2007)","journal-title":"Constraints Ann. Int. J."},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Gr\u00e9goire, \u00c9., Mazure, B., Piette, C.: On approaches to explaining infeasibility of sets of Boolean clauses. In: IEEE 20th International Conference on Tools with Artificial Intelligence, pp. 74\u201383. IEEE Computer Society (2008)","DOI":"10.1109\/ICTAI.2008.39"},{"key":"6_CR9","unstructured":"Han, J.M.: Enhancing SAT solvers with glue variable predictions. CoRR abs\/2007.02559 (2020)"},{"key":"6_CR10","unstructured":"Hemery, F., Lecoutre, C., Sais, L., Boussemart, F.: Extracting MUCs from constraint networks. In: Proceedings of the 17th European Conference on Artificial Intelligence, vol. 141, pp. 113\u2013117. IOS Press (2006)"},{"issue":"8","key":"6_CR11","doi-asserted-by":"publisher","first-page":"1735","DOI":"10.1162\/neco.1997.9.8.1735","volume":"9","author":"S Hochreiter","year":"1997","unstructured":"Hochreiter, S., Schmidhuber, J.: Long short-term memory. Neural Comput. 9(8), 1735\u20131780 (1997)","journal-title":"Neural Comput."},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-030-77091-4_21","volume-title":"AIxIA 2020 \u2013 Advances in Artificial Intelligence","author":"A Ignatiev","year":"2021","unstructured":"Ignatiev, A., Narodytska, N., Asher, N., Marques-Silva, J.: From contrastive to abductive explanations and back again. In: Baldoni, M., Bandini, S. (eds.) AIxIA 2020. LNCS (LNAI), vol. 12414, pp. 335\u2013355. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77091-4_21"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-319-23219-5_13","volume-title":"Principles and Practice of Constraint Programming","author":"A Ignatiev","year":"2015","unstructured":"Ignatiev, A., Previti, A., Liffiton, M., Marques-Silva, J.: Smallest MUS extraction with minimal hitting set dualization. In: Pesant, G. (ed.) CP 2015. LNCS, vol. 9255, pp. 173\u2013182. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23219-5_13"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-642-31951-8_18","volume-title":"Inductive Logic Programming","author":"K Inoue","year":"2012","unstructured":"Inoue, K.: DNF hypotheses in explanatory induction. In: Muggleton, S.H., Tamaddoni-Nezhad, A., Lisi, F.A. (eds.) ILP 2011. LNCS (LNAI), vol. 7207, pp. 173\u2013188. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31951-8_18"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Izza, Y., Marques-Silva, J.: On explaining random forests with SAT. In: Proceedings of the 30th International Joint Conference on Artificial Intelligence, pp. 2584\u20132591. IJCAI (2021)","DOI":"10.24963\/ijcai.2021\/356"},{"key":"6_CR16","unstructured":"Junker, U.: QUICKXPLAIN: preferred explanations and relaxations for over-constrained problems. In: Proceedings of the 19th National Conference on Artificial Intelligence, pp. 167\u2013172. AAAI Press\/The MIT Press (2004)"},{"key":"6_CR17","unstructured":"Kurin, V., Godil, S., Whiteson, S., Catanzaro, B.: Can Q-learning with graph networks learn a generalizable branching heuristic for a SAT solver? In: Advances in Neural Information Processing Systems, vol. 33, pp. 9608\u20139621. Curran Associates, Inc. (2020)"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Lamb, L.C., d\u2019Avila Garcez, A.S., Gori, M., Prates, M.O.R., Avelar, P.H.C., Vardi, M.Y.: Graph neural networks meet neural-symbolic computing: a survey and perspective. In: Proceedings of the 29th International Joint Conference on Artificial Intelligence, pp. 4877\u20134884. IJCAI (2020)","DOI":"10.24963\/ijcai.2020\/679"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Marques-Silva, J.: Minimal unsatisfiability: models, algorithms and applications (Invited Paper). In: IEEE 40th International Symposium on Multiple-Valued Logic, pp. 9\u201314. IEEE Computer Society (2010)","DOI":"10.1109\/ISMVL.2010.11"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Oh, Y., Mneimneh, M.N., Andraus, Z.S., Sakallah, K.A., Markov, I.L.: AMUSE: a minimally-unsatisfiable subformula extractor. In: Proceedings of the 41th Design Automation Conference, pp. 518\u2013523. ACM (2004)","DOI":"10.1145\/996566.996710"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H., Wolfe, D.: The complexity of facets resolved. In: 26th Annual Symposium on Foundations of Computer Science, pp. 74\u201378 (1985)","DOI":"10.1109\/SFCS.1985.56"},{"key":"6_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":"6_CR23","unstructured":"Selsam, D., Lamm, M., B\u00fcnz, B., Liang, P., de Moura, L., Dill, D.L.: Learning a SAT solver from single-bit supervision. In: 7th International Conference on Learning Representations (2019)"},{"key":"6_CR24","unstructured":"Velickovic, P., Cucurull, G., Casanova, A., Romero, A., Li\u00f2, P., Bengio, Y.: Graph attention networks. In: 6th International Conference on Learning Representations (2018)"},{"key":"6_CR25","unstructured":"Wang, W., Hu, Y., Tiwari, M., Khurshid, S., McMillan, K.L., Miikkulainen, R.: NeuroComb: improving SAT solving with graph neural networks. CoRR abs\/2110.14053 (2021)"},{"key":"6_CR26","unstructured":"Zhang, L., Malik, S.: Validating SAT solvers using an independent resolution-based checker: practical implementations and other applications. In: Design, Automation and Test in Europe Conference and Exposition, pp. 10880\u201310885. IEEE Computer Society (2003)"}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49299-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T05:07:18Z","timestamp":1703135238000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49299-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031492983","9783031492990"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49299-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"22 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ILP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Inductive Logic Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bari","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ilp2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ilp2023.unife.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":"https:\/\/easychair.org\/","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18","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":"11","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":"1","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":"61% - 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":"2.89","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":"2.55","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1 late-breaking abstract only for oral presentation (not to be included in the conference proceedings)","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)"}}]}}