{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,18]],"date-time":"2026-04-18T23:02:45Z","timestamp":1776553365624,"version":"3.51.2"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031427527","type":"print"},{"value":"9783031427534","type":"electronic"}],"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-42753-4_4","type":"book-chapter","created":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T06:02:35Z","timestamp":1693375355000},"page":"53-68","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Nominal AC-Matching"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0089-3905","authenticated-orcid":false,"given":"Mauricio","family":"Ayala-Rinc\u00f3n","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8325-5815","authenticated-orcid":false,"given":"Maribel","family":"Fern\u00e1ndez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1679-3597","authenticated-orcid":false,"given":"Gabriel Ferreira","family":"Silva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4084-7380","authenticated-orcid":false,"given":"Temur","family":"Kutsia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1959-8730","authenticated-orcid":false,"given":"Daniele","family":"Nantes-Sobrinho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,28]]},"reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-319-94460-9_14","volume-title":"Logic-Based Program Synthesis and Transformation","author":"M Ayala-Rinc\u00f3n","year":"2018","unstructured":"Ayala-Rinc\u00f3n, M., de Carvalho-Segundo, W., Fern\u00e1ndez, M., Nantes-Sobrinho, D.: Nominal C-unification. In: Fioravanti, F., Gallagher, J.P. (eds.) LOPSTR 2017. LNCS, vol. 10855, pp. 235\u2013251. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94460-9_14"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-319-66167-4_12","volume-title":"Frontiers of Combining Systems","author":"M Ayala-Rinc\u00f3n","year":"2017","unstructured":"Ayala-Rinc\u00f3n, M., de Carvalho-Segundo, W., Fern\u00e1ndez, M., Nantes-Sobrinho, D.: On solving nominal fixpoint equations. In: Dixon, C., Finger, M. (eds.) FroCoS 2017. LNCS (LNAI), vol. 10483, pp. 209\u2013226. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66167-4_12"},{"key":"4_CR3","doi-asserted-by":"publisher","unstructured":"Ayala-Rinc\u00f3n, M., de Carvalho Segundo, W., Fern\u00e1ndez, M., Nantes-Sobrinho, D., Oliveira, A.C.R.: A formalisation of nominal $$\\alpha $$-equivalence with A, C, and AC function symbols. Theor. Comput. Sci. 781, 3\u201323 (2019). https:\/\/doi.org\/10.1016\/j.tcs.2019.02.020","DOI":"10.1016\/j.tcs.2019.02.020"},{"issue":"3","key":"4_CR4","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1017\/S0960129521000050","volume":"31","author":"M Ayala-Rinc\u00f3n","year":"2021","unstructured":"Ayala-Rinc\u00f3n, M., de Carvalho Segundo, W., Fern\u00e1ndez, M., Silva, G.F., Nantes-Sobrinho, D.: Formalising nominal C-unification generalised with protected variables. Math. Struct. Comput. Sci. 31(3), 286\u2013311 (2021). https:\/\/doi.org\/10.1017\/S0960129521000050","journal-title":"Math. Struct. Comput. Sci."},{"key":"4_CR5","doi-asserted-by":"publisher","unstructured":"Ayala-Rinc\u00f3n, M., Fern\u00e1ndez, M., Nantes-Sobrinho, D.: On nominal syntax and permutation fixed points. Log. Methods Comput. Sci. 16(1) (2020). https:\/\/doi.org\/10.23638\/LMCS-16(1:19)2020","DOI":"10.23638\/LMCS-16(1:19)2020"},{"key":"4_CR6","doi-asserted-by":"publisher","unstructured":"Ayala-Rinc\u00f3n, M., Fern\u00e1ndez, M., Oliveira, A.C.R.: Completeness in PVS of a nominal unification algorithm. In: Proceedings of the 10th Workshop on Logical and Semantic Frameworks, with Applications, LSFA. ENTCS, vol. 323, pp. 57\u201374. Elsevier (2015). https:\/\/doi.org\/10.1016\/j.entcs.2016.06.005","DOI":"10.1016\/j.entcs.2016.06.005"},{"key":"4_CR7","doi-asserted-by":"publisher","unstructured":"Ayala-Rinc\u00f3n, M., Fern\u00e1ndez, M., Silva, G.F., Sobrinho, D.N.: A certified algorithm for AC-unification. In: 7th International Conference on Formal Structures for Computation and Deduction, FSCD. LIPIcs, vol. 228, pp. 8:1\u20138:21. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPIcs.FSCD.2022.8","DOI":"10.4230\/LIPIcs.FSCD.2022.8"},{"issue":"2","key":"4_CR8","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/BF00881905","volume":"11","author":"A Boudet","year":"1993","unstructured":"Boudet, A.: Competing for the AC-unification race. J. Autom. Reasoning 11(2), 185\u2013212 (1993). https:\/\/doi.org\/10.1007\/BF00881905","journal-title":"J. Autom. Reasoning"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BFb0017445","volume-title":"Principles and Practice of Constraint Programming-CP97","author":"A Boudet","year":"1997","unstructured":"Boudet, A., Contejean, E.: AC-unification of higher-order patterns. In: Smolka, G. (ed.) CP 1997. LNCS, vol. 1330, pp. 267\u2013281. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0017445"},{"key":"4_CR10","doi-asserted-by":"publisher","unstructured":"Boudet, A., Contejean, E., Devie, H.: A new AC unification algorithm with an algorithm for solving systems of diophantine equations. In: Proceedings of the 5th Annual Symposium on Logic in Computer Science, LICS, pp. 289\u2013299. IEEE Computer Society (1990). https:\/\/doi.org\/10.1109\/LICS.1990.113755","DOI":"10.1109\/LICS.1990.113755"},{"issue":"5","key":"4_CR11","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/j.jcss.2009.10.003","volume":"76","author":"CF Calv\u00e8s","year":"2010","unstructured":"Calv\u00e8s, C.F., Fern\u00e1ndez, M.: Matching and alpha-equivalence check for nominal terms. J. Comput. Syst. Sci. 76(5), 283\u2013301 (2010). https:\/\/doi.org\/10.1016\/j.jcss.2009.10.003","journal-title":"J. Comput. Syst. Sci."},{"issue":"2\u20133","key":"4_CR12","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/j.tcs.2008.05.012","volume":"403","author":"C Calv\u00e8s","year":"2008","unstructured":"Calv\u00e8s, C., Fern\u00e1ndez, M.: A polynomial nominal unification algorithm. Theor. Comput. Sci. 403(2\u20133), 285\u2013306 (2008). https:\/\/doi.org\/10.1016\/j.tcs.2008.05.012","journal-title":"Theor. Comput. Sci."},{"key":"4_CR13","unstructured":"Cheney, J.: Relating nominal and higher-order pattern unification. In: Proceedings of the 19th International Workshop on Unification, UNIF, pp. 104\u2013119 (2005)"},{"issue":"1\u20132","key":"4_CR14","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/S0747-7171(89)80025-2","volume":"8","author":"M Clausen","year":"1989","unstructured":"Clausen, M., Fortenbacher, A.: Efficient solution of linear Diophantine equations. J. Sym. Comput. 8(1\u20132), 201\u2013216 (1989). https:\/\/doi.org\/10.1016\/S0747-7171(89)80025-2","journal-title":"J. Sym. Comput."},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-540-25979-4_5","volume-title":"Rewriting Techniques and Applications","author":"E Contejean","year":"2004","unstructured":"Contejean, E.: A certified AC matching algorithm. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 70\u201384. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-25979-4_5"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/3-540-44881-0_3","volume-title":"Rewriting Techniques and Applications","author":"S Eker","year":"2003","unstructured":"Eker, S.: Associative-commutative rewriting on large terms. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol. 2706, pp. 14\u201329. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-44881-0_3"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-0-387-34768-4_12","volume-title":"7th International Conference on Automated Deduction","author":"F Fages","year":"1984","unstructured":"Fages, F.: Associative-commutative unification. In: Shostak, R.E. (ed.) CADE 1984. LNCS, vol. 170, pp. 194\u2013208. Springer, New York (1984). https:\/\/doi.org\/10.1007\/978-0-387-34768-4_12"},{"issue":"3","key":"4_CR18","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0747-7171(87)80004-4","volume":"3","author":"F Fages","year":"1987","unstructured":"Fages, F.: Associative-commutative unification. J. Sym. Comput. 3(3), 257\u2013275 (1987). https:\/\/doi.org\/10.1016\/S0747-7171(87)80004-4","journal-title":"J. Sym. Comput."},{"issue":"6","key":"4_CR19","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1016\/j.ic.2006.12.002","volume":"205","author":"M Fern\u00e1ndez","year":"2007","unstructured":"Fern\u00e1ndez, M., Gabbay, M.J.: Nominal rewriting. Inf. Comput. 205(6), 917\u2013965 (2007). https:\/\/doi.org\/10.1016\/j.ic.2006.12.002","journal-title":"Inf. Comput."},{"issue":"3","key":"4_CR20","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s001650200016","volume":"13","author":"MJ Gabbay","year":"2002","unstructured":"Gabbay, M.J., Pitts, A.M.: A new approach to abstract syntax with variable binding. Formal Aspects Comput. 13(3), 341\u2013363 (2002). https:\/\/doi.org\/10.1007\/s001650200016","journal-title":"Formal Aspects Comput."},{"key":"4_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-642-14052-5_6","volume-title":"Interactive Theorem Proving","author":"R Kumar","year":"2010","unstructured":"Kumar, R., Norrish, M.: (Nominal) unification by recursive descent with triangular substitutions. In: Kaufmann, M., Paulson, L.C. (eds.) ITP 2010. LNCS, vol. 6172, pp. 51\u201366. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14052-5_6"},{"key":"4_CR22","doi-asserted-by":"publisher","unstructured":"Levy, J., Villaret, M.: An efficient nominal unification algorithm. In: Proceedings of the 21st International Conference on Rewriting Techniques and Applications, RTA. LIPIcs, vol. 6, pp. 209\u2013226. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2010). https:\/\/doi.org\/10.4230\/LIPIcs.RTA.2010.209","DOI":"10.4230\/LIPIcs.RTA.2010.209"},{"key":"4_CR23","doi-asserted-by":"publisher","unstructured":"Levy, J., Villaret, M.: Nominal unification from a higher-order perspective. ACM Trans. Comput. Log. 13(2), 10:1\u201310:31 (2012). https:\/\/doi.org\/10.1145\/2159531.2159532","DOI":"10.1145\/2159531.2159532"},{"key":"4_CR24","unstructured":"Owre, S., Shankar, N.: The formal semantics of PVS. Technical report. 97-2R, SRI International Computer Science Laboratory, Menlo Park CA 94025 USA (1997, revised 1999)"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Pitts, A.M.: Nominal Sets: Names and Symmetry in Computer Science. Cambridge University Press, Cambridge (2013)","DOI":"10.1017\/CBO9781139084673"},{"key":"4_CR26","doi-asserted-by":"publisher","unstructured":"Pottier, F.: An overview of C$$\\alpha $$ML. In: Benton, N., Leroy, X. (eds.) Proceedings of the ACM-SIGPLAN Workshop on ML, ML. Electronic Notes in Theoretical Computer Science, vol. 148, pp. 27\u201352. Elsevier (2005). https:\/\/doi.org\/10.1016\/j.entcs.2005.11.039","DOI":"10.1016\/j.entcs.2005.11.039"},{"key":"4_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/978-3-319-63139-4_19","volume-title":"Logic-Based Program Synthesis and Transformation","author":"M Schmidt-Schau\u00df","year":"2017","unstructured":"Schmidt-Schau\u00df, M., Kutsia, T., Levy, J., Villaret, M.: Nominal unification of higher order expressions with recursive let. In: Hermenegildo, M.V., Lopez-Garcia, P. (eds.) LOPSTR 2016. LNCS, vol. 10184, pp. 328\u2013344. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63139-4_19"},{"issue":"3","key":"4_CR28","doi-asserted-by":"publisher","first-page":"247","DOI":"10.3233\/FI-222110","volume":"185","author":"M Schmidt-Schau\u00df","year":"2022","unstructured":"Schmidt-Schau\u00df, M., Kutsia, T., Levy, J., Villaret, M., Kutz, Y.D.K.: Nominal unification and matching of higher order expressions with recursive let. Fundam. Informaticae 185(3), 247\u2013283 (2022). https:\/\/doi.org\/10.3233\/FI-222110","journal-title":"Fundam. Informaticae"},{"key":"4_CR29","doi-asserted-by":"publisher","unstructured":"Shinwell, M.R., Pitts, A.M., Gabbay, M.: FreshML: programming with binders made simple. In: Proceedings of the 8th ACM SIGPLAN International Conference on Functional Programming, ICFP, pp. 263\u2013274. ACM (2003). https:\/\/doi.org\/10.1145\/944705.944729","DOI":"10.1145\/944705.944729"},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"Stickel, M.E.: A complete unification algorithm for associative-commutative functions. In: Advance Papers of the Fourth International Joint Conference on Artificial Intelligence, IJCAI, pp. 71\u201376 (1975). https:\/\/ijcai.org\/Proceedings\/75\/Papers\/011.pdf","DOI":"10.21236\/ADA015846"},{"issue":"3","key":"4_CR31","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1145\/322261.322262","volume":"28","author":"ME Stickel","year":"1981","unstructured":"Stickel, M.E.: A unification algorithm for associative-commutative functions. J. ACM 28(3), 423\u2013434 (1981). https:\/\/doi.org\/10.1145\/322261.322262","journal-title":"J. ACM"},{"issue":"4","key":"4_CR32","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10817-008-9097-2","volume":"40","author":"C Urban","year":"2008","unstructured":"Urban, C.: Nominal techniques in Isabelle\/HOL. J. Autom. Reason. 40(4), 327\u2013356 (2008). https:\/\/doi.org\/10.1007\/s10817-008-9097-2","journal-title":"J. Autom. Reason."},{"key":"4_CR33","doi-asserted-by":"publisher","unstructured":"Urban, C.: Nominal unification revisited. In: Proceedings of the 24th International Workshop on Unification, UNIF. EPTCS, vol. 42, pp. 1\u201311 (2010). https:\/\/doi.org\/10.4204\/EPTCS.42.1","DOI":"10.4204\/EPTCS.42.1"},{"issue":"1\u20133","key":"4_CR34","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/j.tcs.2004.06.016","volume":"323","author":"C Urban","year":"2004","unstructured":"Urban, C., Pitts, A.M., Gabbay, M.: Nominal unification. Theor. Comput. Sci. 323(1\u20133), 473\u2013497 (2004). https:\/\/doi.org\/10.1016\/j.tcs.2004.06.016","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Intelligent Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-42753-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T06:03:14Z","timestamp":1693375394000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-42753-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031427527","9783031427534"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-42753-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"28 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CICM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computer Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cambridge","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"4 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2023","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":"mkm2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cicm-conference.org\/2023\/cicm.php","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":"31","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":"16","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":"6","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":"52% - 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)"}}]}}