{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T14:19:46Z","timestamp":1772633986726,"version":"3.50.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Autom Reasoning"],"published-print":{"date-parts":[[2014,2]]},"DOI":"10.1007\/s10817-013-9285-6","type":"journal-article","created":{"date-parts":[[2013,4,18]],"date-time":"2013-04-18T00:10:43Z","timestamp":1366243843000},"page":"155-190","source":"Crossref","is-referenced-by-count":18,"title":["Anti-unification for Unranked Terms and Hedges"],"prefix":"10.1007","volume":"52","author":[{"given":"Temur","family":"Kutsia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jordi","family":"Levy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mateu","family":"Villaret","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,4,19]]},"reference":[{"key":"9285_CR1","first-page":"1","volume-title":"Lecture Notes in Computer Science","author":"H A\u00eft-Kaci","year":"2001","unstructured":"A\u00eft-Kaci, H., Sasaki, Y.: An axiomatic approach to feature term generalization. In: Raedt, L.D., Flach, P.A. (eds.) ECML. Lecture Notes in Computer Science, vol.\u00a02167, pp.\u00a01\u201312. Springer, Heidelberg (2001)"},{"key":"9285_CR2","first-page":"24","volume-title":"Lecture Notes in Computer Science","author":"M Alpuente","year":"2008","unstructured":"Alpuente, M., Escobar, S., Meseguer, J., Ojeda, P.: A modular equational generalization algorithm. In: Hanus, M. (ed.) LOPSTR. Lecture Notes in Computer Science, vol.\u00a05438, pp.\u00a024\u201339. Springer, Heidelberg (2008)"},{"key":"9285_CR3","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.entcs.2009.07.013","volume":"246","author":"M Alpuente","year":"2009","unstructured":"Alpuente, M., Escobar, S., Meseguer, J., Ojeda, P.: Order-sorted generalization. Electr. Notes Theor. Comput. Sci. 246, 27\u201338 (2009)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"issue":"3","key":"9285_CR4","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1023\/A:1007677713969","volume":"41","author":"E Armengol","year":"2000","unstructured":"Armengol, E., Plaza, E.: Bottom-up induction of feature terms. Mach. Learn. 41(3), 259\u2013294 (2000)","journal-title":"Mach. Learn."},{"key":"9285_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/3-540-53904-2_88","volume-title":"RTA","author":"F Baader","year":"1991","unstructured":"Baader, F.: Unification, weak unification, upper bound, lower bound, and generalization problems. In: Book, R.V. (ed.) RTA. Lecture Notes in Computer Science, vol.\u00a0488, pp.\u00a086\u201397. Springer, Heidelberg (1991)"},{"key":"9285_CR6","doi-asserted-by":"crossref","unstructured":"Baxter, I.D., Yahin, A., de\u00a0Moura, L.M., Sant\u2019Anna, M., Bier, L.: Clone detection using abstract syntax trees. In: ICSM, pp.\u00a0368\u2013377 (1998)","DOI":"10.1109\/ICSM.1998.738528"},{"key":"9285_CR7","unstructured":"Biere, A.: Normalisation, unification and generalisation in free monoids. Master\u2019s thesis, University of Karlsruhe (in German, 1993)"},{"key":"9285_CR8","doi-asserted-by":"crossref","unstructured":"Bulychev, P., Minea, M.: An evaluation of duplicate code detection using anti-unification. In:\u00a0Proc. 3rd International Workshop on Software Clones (2009)","DOI":"10.15514\/SYRCOSE-2008-2-22"},{"key":"9285_CR9","series-title":"Lecture Notes in Computer Science","first-page":"413","volume-title":"Ershov Memorial Conference.","author":"PE Bulychev","year":"2009","unstructured":"Bulychev, P.E., Kostylev, E.V., Zakharov, V.A.: Anti-unification algorithms and their applications in program analysis. In: Pnueli, A., Virbitskaite, I., Voronkov, A. (eds.) Ershov Memorial Conference. Lecture Notes in Computer Science, vol.\u00a05947, pp.\u00a0413\u2013423. Springer, Heidelberg (2009)"},{"issue":"1","key":"9285_CR10","doi-asserted-by":"crossref","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)","journal-title":"Artif. Intell."},{"issue":"1","key":"9285_CR11","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10489-006-8864-1","volume":"25","author":"I Cicekli","year":"2006","unstructured":"Cicekli, I., Cicekli, N.K.: Generalizing predicates with string arguments. Appl. Intell. 25(1):23\u201336 (2006)","journal-title":"Appl. Intell."},{"issue":"5","key":"9285_CR12","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1016\/j.jsc.2010.01.007","volume":"45","author":"H Cirstea","year":"2010","unstructured":"Cirstea, H., Kirchner, C., Kopetz, R., Moreau, P.E.: Anti-patterns for rule-based languages. J.\u00a0Symb. Comput. 45(5), 523\u2013550 (2010)","journal-title":"J.\u00a0Symb. Comput."},{"issue":"3","key":"9285_CR13","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/BF00245298","volume":"9","author":"AL Delcher","year":"1992","unstructured":"Delcher, A.L., Kasif, S.: Efficient parallel term matching and anti-unification. J. Autom. Reasoning 9(3), 391\u2013406 (1992)","journal-title":"J. Autom. Reasoning"},{"issue":"4","key":"9285_CR14","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/s11219-009-9074-y","volume":"17","author":"WS Evans","year":"2009","unstructured":"Evans, W.S., Fraser, C.W., Ma, F.: Clone detection via structural abstraction. Softw. Qual. J. 17(4), 309\u2013330 (2009)","journal-title":"Softw. Qual. J."},{"key":"9285_CR15","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences\u2014Computer Science and Computational Biology","author":"D Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences\u2014Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)"},{"key":"9285_CR16","unstructured":"Huet, G.: R\u00e9solution d\u2019\u00e9quations dans des langages d\u2019ordre 1,2,...,\u03c9. PhD thesis, Universit\u00e9 Paris VII (1976)"},{"key":"9285_CR17","first-page":"429","volume":"7","author":"E Kitzelmann","year":"2006","unstructured":"Kitzelmann, E., Schmid, U.: Inductive synthesis of functional programs: an explanation based generalization approach. J. Mach. Learn. Res. 7, 429\u2013454 (2006)","journal-title":"J. Mach. Learn. Res."},{"key":"9285_CR18","doi-asserted-by":"crossref","unstructured":"Koschke, R., Falke, R., Frenzel, P.: Clone detection using abstract syntax suffix trees. In: WCRE, pp.\u00a0253\u2013262. IEEE Computer Society (2006)","DOI":"10.1109\/WCRE.2006.18"},{"key":"9285_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/978-3-540-76928-6_29","volume-title":"Australian Conference on Artificial Intelligence","author":"U Krumnack","year":"2007","unstructured":"Krumnack, U., Schwering, A., Gust, H., K\u00fchnberger, K.U.: Restricted higher-order anti-unification for analogy making. In: Orgun, M.A., Thornton, J. (eds.) Australian Conference on Artificial Intelligence. Lecture Notes in Computer Science, vol.\u00a04830, pp.\u00a0273\u2013282. Springer, Heidelberg (2007)"},{"issue":"3","key":"9285_CR20","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1016\/j.jsc.2006.12.002","volume":"42","author":"T Kutsia","year":"2007","unstructured":"Kutsia, T.: Solving equations with sequence variables and sequence functions. J. Symb. Comput. 42(3), 352\u2013388 (2007)","journal-title":"J. Symb. Comput."},{"issue":"12","key":"9285_CR21","doi-asserted-by":"crossref","first-page":"858","DOI":"10.1016\/j.jsc.2008.05.001","volume":"43","author":"T Kutsia","year":"2008","unstructured":"Kutsia, T.: Flat matching. J. Symb. Comput. 43(12), 858\u2013873 (2008)","journal-title":"J. Symb. Comput."},{"key":"9285_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/11591191_16","volume-title":"LPAR","author":"T Kutsia","year":"2005","unstructured":"Kutsia, T., Marin, M.: Matching with regular constraints. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR. Lecture Notes in Computer Science, vol.\u00a03835, pp.\u00a0215\u2013229. Springer, Heidelberg (2005)"},{"key":"9285_CR23","unstructured":"Kutsia, T., Marin, M.: Order-sorted unification with regular expression sorts. In: Lynch, C. (ed.) RTA, Schloss Dagstuhl\u2014Leibniz-Zentrum fuer Informatik, LIPIcs, vol.\u00a06, pp.\u00a0193\u2013208 (2010)"},{"key":"9285_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1007\/978-3-540-73449-9_22","volume-title":"RTA","author":"T Kutsia","year":"2007","unstructured":"Kutsia, T., Levy, J., Villaret, M.: Sequence unification through currying. In: Baader, F. (ed.) RTA. Lecture Notes in Computer Science, vol.\u00a04533, pp.\u00a0288\u2013302. Springer, Heidelberg (2007)"},{"issue":"1","key":"9285_CR25","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.jsc.2009.07.001","volume":"45","author":"T Kutsia","year":"2010","unstructured":"Kutsia, T., Levy, J., Villaret, M.: On the relation between context and sequence unification. J.\u00a0Symb. Comput. 45(1), 74\u201395 (2010)","journal-title":"J.\u00a0Symb. Comput."},{"key":"9285_CR26","unstructured":"Kutsia, T., Levy, J., Villaret, M.: Anti-unification for unranked terms and hedges. In: Schmidt-Schau\u00df, M. (ed.) RTA. Schloss Dagstuhl\u2014Leibniz-Zentrum fuer Informatik, LIPIcs, vol.\u00a010, pp.\u00a0219\u2013234 (2011)"},{"key":"9285_CR27","series-title":"Lecture Notes in Computer Science","first-page":"104","volume-title":"PADL","author":"H Li","year":"2010","unstructured":"Li, H., Thompson, S.J.: Similar code detection and elimination for erlang programs. In: Carro, M., Pe\u00f1a, R. (eds.) PADL. Lecture Notes in Computer Science, vol.\u00a05937, pp.\u00a0104\u2013118. Springer, Heidelberg (2010)"},{"issue":"1\u20134","key":"9285_CR28","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1023\/A:1018952121991","volume":"28","author":"J Lu","year":"2000","unstructured":"Lu, J., Mylopoulos, J., Harao, M., Hagiya, M.: Higher order generalization and its application in program verification. Ann. Math. Artif. Intell. 28(1\u20134), 107\u2013126 (2000)","journal-title":"Ann. Math. Artif. Intell."},{"key":"9285_CR29","doi-asserted-by":"crossref","unstructured":"Pfenning, F.: Unification and anti-unification in the calculus of constructions. In: LICS, pp.\u00a074\u201385. IEEE Computer Society (1991)","DOI":"10.1109\/LICS.1991.151632"},{"key":"9285_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/3-540-60598-3_24","volume-title":"ICCBR","author":"E Plaza","year":"1995","unstructured":"Plaza, E.: Cases as terms: a feature term approach to the structured representation of cases. In: Veloso, M.M., Aamodt, A. (eds.) ICCBR. Lecture Notes in Computer Science, vol.\u00a01010, pp.\u00a0265\u2013276. Springer, Heidelberg (1995)"},{"issue":"1","key":"9285_CR31","first-page":"153","volume":"5","author":"GD Plotkin","year":"1970","unstructured":"Plotkin, G.D.: A note on inductive generalization. Mach. Intell. 5(1), 153\u2013163 (1970)","journal-title":"Mach. Intell."},{"issue":"1","key":"9285_CR32","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(1), 135\u2013151 (1970)","journal-title":"Mach. Intell."},{"key":"9285_CR33","unstructured":"Roy, C.K., Cordy, J.R.: A Survey of Software Clone Detection Research. Tech. rep., School of Computing, Queen\u2019s University at Kingston, ON, Canada (2007)"},{"issue":"7","key":"9285_CR34","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1016\/j.scico.2009.02.007","volume":"74","author":"CK Roy","year":"2009","unstructured":"Roy, C.K., Cordy, J.R., Koschke, R.: Comparison and evaluation of code clone detection techniques and tools: a qualitative approach. Sci. Comput. Program 74(7), 470\u2013495 (2009)","journal-title":"Sci. Comput. Program"},{"key":"9285_CR35","volume-title":"Lecture Notes in Computer Science, vol","author":"U Schmid","year":"2003","unstructured":"Schmid, U.: Inductive synthesis of functional programs, universal planning, folding of finite programs and schema abstraction by analogical reasoning. In: Lecture Notes in Computer Science, vol.\u00a02654. Springer, Heidelberg (2003)"},{"key":"9285_CR36","first-page":"128","volume-title":"SCAM","author":"V Wahler","year":"2004","unstructured":"Wahler, V., Seipel, D., von Gudenberg, J.W., Fischer, G.: Clone detection in source code by frequent itemset techniques. In: SCAM, pp.\u00a0128\u2013135. IEEE Computer Society Press, Los Alamitos (2004)"},{"key":"9285_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1007\/3-540-44797-0","volume-title":"ILP","author":"C Rouveirol","year":"2001","unstructured":"Yamamoto, A., Ito, K., Ishino, A., Arimura, H.: Modelling semi-structured documents with hedges for deduction and induction. In: Rouveirol, C., Sebag, M. (eds.) ILP. Lecture Notes in Computer Science, vol.\u00a02157, pp.\u00a0240\u2013247. Springer, Heidelberg (2001)"},{"issue":"7","key":"9285_CR38","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1002\/spe.4380210706","volume":"21","author":"W Yang","year":"1991","unstructured":"Yang, W.: Identifying syntactic differences between two programs. Softw. Pract. Exper. 21(7), 739\u2013755 (1991)","journal-title":"Softw. Pract. Exper."}],"container-title":["Journal of Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10817-013-9285-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T05:33:31Z","timestamp":1745991211000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10817-013-9285-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,19]]},"references-count":38,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["9285"],"URL":"https:\/\/doi.org\/10.1007\/s10817-013-9285-6","relation":{},"ISSN":["0168-7433","1573-0670"],"issn-type":[{"value":"0168-7433","type":"print"},{"value":"1573-0670","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,19]]}}}