{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:44:03Z","timestamp":1742913843302,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031167669"},{"type":"electronic","value":"9783031167676"}],"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-16767-6_3","type":"book-chapter","created":{"date-parts":[[2022,9,10]],"date-time":"2022-09-10T16:02:40Z","timestamp":1662825760000},"page":"44-60","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Variant-Based Equational Anti-unification"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9268-1178","authenticated-orcid":false,"given":"Mar\u00eda","family":"Alpuente","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1048-1739","authenticated-orcid":false,"given":"Demis","family":"Ballis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3550-4781","authenticated-orcid":false,"given":"Santiago","family":"Escobar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2994-6986","authenticated-orcid":false,"given":"Julia","family":"Sapi\u00f1a","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,11]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.ic.2014.01.006","volume":"235","author":"M Alpuente","year":"2014","unstructured":"Alpuente, M., Escobar, S., Espert, J., Meseguer, J.: A modular order-sorted equational generalization algorithm. Inf. Comput. 235, 98\u2013136 (2014). https:\/\/doi.org\/10.1016\/j.ic.2014.01.006","journal-title":"Inf. Comput."},{"issue":"5","key":"3_CR2","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/s10472-021-09771-1","volume":"90","author":"M Alpuente","year":"2022","unstructured":"Alpuente, M., Escobar, S., Meseguer, J., Sapi\u00f1a, J.: Order-sorted equational generalization algorithm revisited. Ann. Math. Artif. Intell. 90(5), 499\u2013522 (2022). https:\/\/doi.org\/10.1007\/s10472-021-09771-1","journal-title":"Ann. Math. Artif. Intell."},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-74141-1_3","volume-title":"Case-Based Reasoning Research and Development","author":"E Armengol","year":"2007","unstructured":"Armengol, E.: Usages of generalization in case-based reasoning. In: Weber, R.O., Richter, M.M. (eds.) ICCBR 2007. LNCS (LNAI), vol. 4626, pp. 31\u201345. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74141-1_3"},{"key":"3_CR4","doi-asserted-by":"publisher","unstructured":"Bader, J., Scott, A., Pradel, M., Chandra, S.: Getafix: learning to fix bugs automatically. In: Proceedings of the 34th Annual ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA 2019), pp. 159:1\u2013159:27. Association for Computing Machinery (2019). https:\/\/doi.org\/10.1145\/3360585","DOI":"10.1145\/3360585"},{"issue":"1","key":"3_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2005.01.008","volume":"165","author":"J Burghardt","year":"2005","unstructured":"Burghardt, J.: E-generalization using grammars. Artif. Intell. 165(1), 1\u201335 (2005). https:\/\/doi.org\/10.1016\/j.artint.2005.01.008","journal-title":"Artif. Intell."},{"key":"3_CR6","doi-asserted-by":"publisher","unstructured":"Cerna, D.M., Kutsia, T.: Idempotent anti-unification. ACM Trans. Comput. Logic 21(2), 10:1\u201310:32 (2020). https:\/\/doi.org\/10.1145\/3359060","DOI":"10.1145\/3359060"},{"key":"3_CR7","doi-asserted-by":"publisher","unstructured":"Cerna, D.M., Kutsia, T.: Unital anti-unification: type and algorithms. In: Proceedings of the 5th IARCS International Conference on Formal Structures for Computation and Deduction (FSCD 2020), Leibniz International Proceedings in Informatics (LIPIcs), vol. 167, pp. 26:1\u201326:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.FSCD.2020.26","DOI":"10.4230\/LIPIcs.FSCD.2020.26"},{"key":"3_CR8","unstructured":"Clavel, M., et al.: Maude Manual (Version 3.2.1). Technical Report, SRI International Computer Science Laboratory (2022). http:\/\/maude.cs.illinois.edu"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-540-32033-3_22","volume-title":"Term Rewriting and Applications","author":"H Comon-Lundh","year":"2005","unstructured":"Comon-Lundh, H., Delaune, S.: The finite variant property: how to get rid of some algebraic properties. In: Giesl, J. (ed.) RTA 2005. LNCS, vol. 3467, pp. 294\u2013307. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-32033-3_22"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-319-40229-1_13","volume-title":"Automated Reasoning","author":"F Dur\u00e1n","year":"2016","unstructured":"Dur\u00e1n, F., Eker, S., Escobar, S., Mart\u00ed-Oliet, N., Meseguer, J., Talcott, C.: Built-in variant generation and unification, and their applications in maude 2.7. In: Olivetti, N., Tiwari, A. (eds.) IJCAR 2016. LNCS (LNAI), vol. 9706, pp. 183\u2013192. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40229-1_13"},{"issue":"7\u20138","key":"3_CR11","doi-asserted-by":"publisher","first-page":"898","DOI":"10.1016\/j.jlap.2012.01.002","volume":"81","author":"S Escobar","year":"2012","unstructured":"Escobar, S., Sasse, R., Meseguer, J.: Folding variant narrowing and optimal variant termination. J. Logic Algebraic Program. 81(7\u20138), 898\u2013928 (2012). https:\/\/doi.org\/10.1016\/j.jlap.2012.01.002","journal-title":"J. Logic Algebraic Program."},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0304-3975(92)90302-V","volume":"105","author":"JA Goguen","year":"1992","unstructured":"Goguen, J.A., Meseguer, J.: Order-sorted algebra i: equational deduction for multiple inheritance, overloading, exceptions and partial operations. Theor. Comput. Sci. 105, 217\u2013273 (1992). https:\/\/doi.org\/10.1016\/0304-3975(92)90302-V","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"3_CR13","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1109\/MS.2021.3071086","volume":"38","author":"S Kirbas","year":"2021","unstructured":"Kirbas, S., et al.: On the introduction of automatic program repair in bloomberg. IEEE Softw. 38(4), 43\u201351 (2021). https:\/\/doi.org\/10.1109\/MS.2021.3071086","journal-title":"IEEE Softw."},{"issue":"2","key":"3_CR14","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s10817-013-9285-6","volume":"52","author":"T Kutsia","year":"2013","unstructured":"Kutsia, T., Levy, J., Villaret, M.: Anti-unification for unranked terms and hedges. J. Autom. Reasoning 52(2), 155\u2013190 (2013). https:\/\/doi.org\/10.1007\/s10817-013-9285-6","journal-title":"J. Autom. Reasoning"},{"issue":"1","key":"3_CR15","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","volume":"96","author":"J Meseguer","year":"1992","unstructured":"Meseguer, J.: Conditional rewriting logic as a unified model of concurrency. Theor. Comput. Sci. 96(1), 73\u2013155 (1992). https:\/\/doi.org\/10.1016\/0304-3975(92)90182-F","journal-title":"Theor. Comput. Sci."},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/3-540-64299-4_26","volume-title":"Recent Trends in Algebraic Development Techniques","author":"J Meseguer","year":"1998","unstructured":"Meseguer, J.: Membership algebra as a logical framework for equational specification. In: Presicce, F.P. (ed.) WADT 1997. LNCS, vol. 1376, pp. 18\u201361. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-64299-4_26"},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2016.12.026","volume":"672","author":"J Meseguer","year":"2017","unstructured":"Meseguer, J.: Strict coherence of conditional rewriting modulo axioms. Theor. Comput. Sci. 672, 1\u201335 (2017). https:\/\/doi.org\/10.1016\/j.tcs.2016.12.026","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"3_CR18","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/S0004-3702(99)00067-3","volume":"114","author":"S Muggleton","year":"1999","unstructured":"Muggleton, S.: Inductive logic programming: issues, results and the challenge of learning language in logic. Artif. Intell. 114(1), 283\u2013296 (1999). https:\/\/doi.org\/10.1016\/S0004-3702(99)00067-3","journal-title":"Artif. Intell."},{"issue":"1","key":"3_CR19","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10994-011-5274-3","volume":"87","author":"S Onta\u00f1\u00f3n","year":"2012","unstructured":"Onta\u00f1\u00f3n, S., Plaza, E.: Similarity measures over refinement graphs. Mach. Learn. 87(1), 57\u201392 (2012). https:\/\/doi.org\/10.1007\/s10994-011-5274-3","journal-title":"Mach. Learn."},{"key":"3_CR20","first-page":"153","volume":"5","author":"GD Plotkin","year":"1970","unstructured":"Plotkin, G.D.: A note on inductive generalization. Mach. Intell. 5, 153\u2013163 (1970)","journal-title":"Mach. Intell."},{"key":"3_CR21","first-page":"135","volume":"5","author":"JC Reynolds","year":"1970","unstructured":"Reynolds, J.C.: Transformational systems and the algebraic structure of atomic formulas. Mach. Intell. 5, 135\u2013151 (1970)","journal-title":"Mach. Intell."},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-540-68894-5_2","volume-title":"Formal Methods for Computational Systems Biology","author":"C Talcott","year":"2008","unstructured":"Talcott, C.: Pathway logic. In: Bernardo, M., Degano, P., Zavattaro, G. (eds.) SFM 2008. LNCS, vol. 5016, pp. 21\u201353. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68894-5_2"},{"key":"3_CR23","doi-asserted-by":"publisher","unstructured":"TeReSe: Term Rewriting Systems. Cambridge University Press, Cambridge (2003). https:\/\/doi.org\/10.1017\/S095679680400526X","DOI":"10.1017\/S095679680400526X"}],"container-title":["Lecture Notes in Computer Science","Logic-Based Program Synthesis and Transformation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-16767-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,14]],"date-time":"2022-09-14T23:17:50Z","timestamp":1663197470000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-16767-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031167669","9783031167676"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-16767-6_3","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":"11 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LOPSTR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Logic-Based Program Synthesis and Transformation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tbilisi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Georgia","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":"21 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2022","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":"lopstr2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/lopstr2022.webs.upv.es","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":"17","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":"8","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":"47% - 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)"}}]}}