{"type":"ScholarlyArticle","title":"Anti-unification and Generalization: A Survey","authors":[{"name":"David M. Cerna","slug":"david-m-cerna","given":"David M.","family":"Cerna","affiliation":"Czech Academy of Sciences Institute of Computer Science (CAS ICS) , Prague , Czechia"},{"name":"Temur Kutsia","slug":"temur-kutsia","given":"Temur","family":"Kutsia","affiliation":"Research Institute for Symbolic Computation (RISC) , Johannes Kepler University , Linz , Austria"}],"abstract":"Anti-unification (AU) is a fundamental operation for generalization computation used for inductive inference. It is the dual operation to unification, an operation at the foundation of automated theorem proving. Interest in AU from the AI and related communities is growing, but without a systematic study of the concept nor surveys of existing work, investigations often resort to developing application-specific methods that existing approaches may cover. We provide the first survey of AU research and its applications and a general framework for categorizing existing and future developments.","doi":"10.24963/ijcai.2023/736","url":"https://ijcai.org/proceedings/2023/736","pdf":"https://ijcai.org/proceedings/2023/0736.pdf","markdown":"https://ijcai.org/proceedings/2023/736.md","bibtex":"https://ijcai.org/proceedings/2023/bibtex/736","volume":{"slug":"2023","title":"Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2023","url":"https://ijcai.org/proceedings/2023/","year":2023,"location":"Macao, SAR","dates":"19-25 August 2023","editors":"Edith Elkind","isbn":"978-1-956792-03-4","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2023"},"section":"Survey Track","track":"Survey Track","number":736,"pages":{"first":6563,"last":6573},"keywords":["Survey: Knowledge Representation and Reasoning","Survey: Multidisciplinary Topics and Applications"],"videos":[],"references":[{"position":1,"raw":"[Aït-Kaci and Pasi, 2020] Hassan Aït-Kaci and Gabriella Pasi. Fuzzy lattice operations on first-order terms over signatures with similar constructors: A constraint-based approach. Fuzzy Sets and Systems, 391:1-46, 2020.","title":"Fuzzy lattice operations on first-order terms over signatures with similar constructors: A constraint-based approach","authors":"Hassan Aït, -Kaci, Gabriella Pasi","year":"2020","venue":"Fuzzy Sets and Systems","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Aït-Kaci and Sasaki, 2001] Hassan Aït-Kaci and Yutaka Sasaki. An axiomatic approach to feature term general- ization. In EMCL. Springer, 2001.","title":"An axiomatic approach to feature term generalization","authors":"Hassan Aït, -Kaci, Yutaka Sasaki","year":"2001","venue":"EMCL","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Alpuente et al., 2014] María Alpuente, Santiago Escobar, Javier Espert, and José Meseguer. A modular order-sorted equational generalization algorithm. Inf. Comput., 235:98- 136, 2014.","title":"A modular order-sorted equational generalization algorithm","authors":"Alpuente","year":"2014","venue":"Inf. Comput","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Alpuente et al., 2022] María Alpuente, Santiago Escobar, José Meseguer, and Julia Sapiña. Order-sorted equational generalization algorithm revisited. Ann. Math. Artif. Intell., 90(5):499-522, 2022.","title":"Order-sorted equational generalization algorithm revisited","authors":"Alpuente","year":"2022","venue":"Ann. Math. Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Armengol and Plaza, 2000] Eva Armengol and Enric Plaza. Bottom-up induction of feature terms. Mach. Learn., 41(3):259-294, 2000.","title":"Eva Armengol and Enric Plaza. Bottom-up induction of feature terms","authors":"Plaza Armengol","year":"2000","venue":"Mach. Learn","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Arusoaie and Lucanu, 2022] Andrei Arusoaie and Dorel Lu- canu. Proof-carrying parameters in certified symbolic ex- ecution: The case study of antiunification. In FROM, EPTCS, 2022.","title":"Andrei Arusoaie and Dorel Lucanu. Proof-carrying parameters in certified symbolic execution: The case study of antiunification","authors":"Lucanu Arusoaie","year":"2022","venue":"FROM, EPTCS","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Baader and Snyder, 2001] Franz Baader and Wayne Snyder. Unification theory. In Handbook of Automated Reasoning. Elsevier, 2001.","title":"Unification theory","authors":"Snyder Baader, Franz Baader, Wayne Snyder","year":"2001","venue":"Handbook of Automated Reasoning","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Baader et al., 1999] Franz Baader, Ralf Küsters, and Ralf Molitor. Computing least common subsumers in descrip- tion logics with existential restrictions. In IJCAI.","title":"Computing least common subsumers in description logics with existential restrictions","authors":"Baader","year":"1999","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/1999/15"},{"position":9,"raw":"Morgan Kaufmann, 1999.","title":null,"authors":"Morgan Kaufmann","year":"1999","venue":null,"doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Baader et al., 2007] Franz Baader, Baris Sertkaya, and Anni- Yasmin Turhan. Computing the least common subsumer w.r.t. a background terminology. J. Appl. Log., 5(3):392- 420, 2007.","title":"Computing the least common subsumer w.r.t. a background terminology","authors":"Baader","year":"2007","venue":"J. Appl. Log","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Baader, 1991] Franz Baader. Unification, weak unification, upper bound, lower bound, and generalization problems. In RTA, LNCS, 1991.","title":"Unification, weak unification, upper bound, lower bound, and generalization problems","authors":"Franz Baader","year":"1991","venue":"RTA, LNCS","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Bader et al., 2019] Johannes Bader, Andrew Scott, Michael Pradel, and Satish Chandra. Getafix: learning to fix bugs automatically. Proc. ACM Program. Lang., 3(OOPSLA), 2019.","title":"Getafix: learning to fix bugs automatically","authors":"Johannes Bader, Andrew Scott, Michael Pradel, Satish Chandra","year":"2019","venue":"Proc. ACM Program. Lang","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Barendregt et al., 2013] Hendrik Pieter Barendregt, Wil Dekkers, and Richard Statman. Lambda Calculus with Types. Perspectives in logic. Cambridge University Press, 2013.","title":"Lambda Calculus with Types","authors":"Pieter Hendrik, Wil Barendregt, Richard Dekkers, Statman","year":"2013","venue":"Perspectives in logic","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Barwell et al., 2018] Adam D. Barwell, Christopher Brown, and Kevin Hammond. Finding parallel functional pearls: Automatic parallel recursion scheme detection in Haskell functions via anti-unification. Future Gener. Comput. Syst., 79:669-686, 2018.","title":"Finding parallel functional pearls: Automatic parallel recursion scheme detection in Haskell functions via anti-unification","authors":"Adam D Barwell, Christopher Brown, Kevin Hammond","year":"2018","venue":"Future Gener. Comput. Syst","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Baumgartner and Kutsia, 2017] Alexander Baumgartner and Temur Kutsia. Unranked second-order anti-unification. Inf. Comput., 255:262-286, 2017.","title":"Unranked second-order anti-unification","authors":"Kutsia Baumgartner, Alexander Baumgartner, Temur Kutsia","year":"2017","venue":"Inf. Comput","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Baumgartner et al., 2015] Alexander Baumgartner, Temur Kutsia, Jordi Levy, and Mateu Villaret. Nominal anti- unification. In RTA, LIPIcs, 2015.","title":"Nominal antiunification","authors":"Alexander Baumgartner, Temur Kutsia, Jordi Levy, Mateu Villaret","year":"2015","venue":"RTA, LIPIcs","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Baumgartner et al., 2017] Alexander Baumgartner, Temur Kutsia, Jordi Levy, and Mateu Villaret. Higher-order pat- tern anti-unification in linear time. J. Autom. Reason., 58(2):293-310, 2017.","title":"Higher-order pattern anti-unification in linear time","authors":"Alexander Baumgartner, Temur Kutsia, Jordi Levy, Mateu Villaret","year":"2017","venue":"J. Autom. Reason","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Baumgartner et al., 2018] Alexander Baumgartner, Temur Kutsia, Jordi Levy, and Mateu Villaret. Term-graph anti- unification. In FSCD, LIPIcs, 2018.","title":"Term-graph antiunification","authors":"Alexander Baumgartner, Temur Kutsia, Jordi Levy, Mateu Villaret","year":"2018","venue":"FSCD, LIPIcs","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Biere, 1993] Armin Biere. Normalisation, unification and generalisation in free monoids. Master's thesis, University of Karlsruhe, 1993.","title":"Normalisation, unification and generalisation in free monoids","authors":"Armin Biere, Biere","year":"1993","venue":null,"doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Bowers et al., 2023] Matthew Bowers, Theo X. Olausson, Lionel Wong, Gabriel Grand, Joshua B. Tenenbaum, Kevin Ellis, and Armando Solar-Lezama. Top-down synthesis for library learning. Proc. ACM Program. Lang., 7(POPL), 2023.","title":"Top-down synthesis for library learning","authors":"Matthew Bowers, Theo X Olausson, Lionel Wong, Gabriel Grand, Joshua B Tenenbaum, Kevin Ellis, Armando Solar-Lezama","year":"2023","venue":"Proc. ACM Program. Lang","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Bulychev and Minea, 2008] Peter Bulychev and Marius Minea. Duplicate code detection using anti-unification. In SYRCOSE, 2008.","title":"Duplicate code detection using anti-unification","authors":"Minea Bulychev, Peter Bulychev, Marius Minea","year":"2008","venue":"SYRCOSE","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Bulychev et al., 2009] Peter E. Bulychev, Egor V. Kostylev, and Vladimir A. Zakharov. Anti-unification algorithms and their applications in program analysis. In PSI, LNCS, 2009.","title":"Anti-unification algorithms and their applications in program analysis","authors":"Peter E Bulychev, V Egor, Vladimir A Kostylev, Zakharov","year":"2009","venue":"PSI, LNCS","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Burghardt, 2005] Jochen Burghardt. E-generalization using grammars. Artif. Intell., 165(1):1-35, 2005.","title":"E-generalization using grammars","authors":"Jochen Burghardt","year":"2005","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Cao et al., 2023] David Cao, Rose Kunkel, Chandrakana Nandi, Max Willsey, Zachary Tatlock, and Nadia Polikar- pova. Babble: Learning better abstractions with e-graphs and anti-unification. Proc. ACM Program. Lang., 7(POPL), 2023.","title":"Babble: Learning better abstractions with e-graphs and anti-unification","authors":"David Cao, Rose Kunkel, Chandrakana Nandi, Max Willsey, Zachary Tatlock, Nadia Polikarpova","year":"2023","venue":"Proc. ACM Program. Lang","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Cerna and Buran, 2022] David M. Cerna and Michal Buran. One or nothing: Anti-unification over the simply-typed lambda calculus. CoRR, abs/2207.08918, 2022.","title":"One or nothing: Anti-unification over the simply-typed lambda calculus","authors":"David M Cerna, Michal Buran","year":"2022","venue":null,"doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Cerna and Cropper, 2023] David M. Cerna and Andrew Cropper. Generalisation through negation and predicate invention. CoRR, abs/2301.07629, 2023.","title":"Generalisation through negation and predicate invention","authors":"David M Cerna, Andrew Cropper","year":"2023","venue":null,"doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Cerna and Kutsia, 2019] David M. Cerna and Temur Kutsia. A generic framework for higher-order generalizations. In FSCD, LIPIcs, 2019.","title":"A generic framework for higher-order generalizations","authors":"David M Cerna, Temur Kutsia","year":"2019","venue":"FSCD, LIPIcs","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Cerna and Kutsia, 2020a] David M. Cerna and Temur Kut- sia. Higher-order pattern generalization modulo equational theories. Math. Struct. Comput. Sci., 30(6):627-663, 2020.","title":"Higher-order pattern generalization modulo equational theories","authors":"Kutsia Cerna, David M Cerna, Temur Kutsia","year":"2020","venue":"Math. Struct. Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Cerna and Kutsia, 2020b] David M. Cerna and Temur Kut- sia. Idempotent anti-unification. ACM Trans. Comput. Log., 21(2):10:1-10:32, 2020.","title":"Idempotent anti-unification","authors":"Kutsia Cerna, David M Cerna, Temur Kutsia","year":"2020","venue":"ACM Trans. Comput. Log","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Cerna and Kutsia, 2020c] David M. Cerna and Temur Kut- sia. Unital anti-unification: Type and algorithms. In FSCD, LIPIcs, 2020.","title":"Unital anti-unification: Type and algorithms","authors":"Cerna, M Kutsia ; C] David, Temur Cerna, Kutsia","year":"2020","venue":"FSCD","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Cerna, 2020] David M. Cerna. Anti-unification and the the- ory of semirings. Theor. Comput. Sci., 848:133-139, 2020.","title":"Anti-unification and the theory of semirings","authors":"M David, Cerna","year":"2020","venue":"Theor. Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Clavel et al., 2002] Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, and Jose F. Quesada. Maude: specification and program- ming in rewriting logic. Theor. Comput. Sci., 285(2):187- 243, 2002.","title":"Maude: specification and programming in rewriting logic","authors":"Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, Jose F Quesada","year":"2002","venue":"Theor. Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Cohen and Hirsh, 1994] William W. Cohen and Haym Hirsh. Learning the classic description logic: Theoretical and experimental results. In KR. Morgan Kaufmann, 1994.","title":"Learning the classic description logic: Theoretical and experimental results","authors":"William W Cohen, Haym Hirsh","year":"1994","venue":null,"doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[Cropper and Morel, 2021] Andrew Cropper and Rolf Morel. Learning programs by learning from failures. Mach. Learn., 110(4):801-856, 2021.","title":"Learning programs by learning from failures","authors":"Andrew Cropper, Rolf Morel","year":"2021","venue":"Mach. Learn","doi":null,"url":null,"internal_url":null},{"position":35,"raw":"[Cropper et al., 2022] Andrew Cropper, Sebastijan Duman- cic, Richard Evans, and Stephen H. Muggleton. Inductive logic programming at 30. Mach. Learn., 111(1):147-172, 2022.","title":"Inductive logic programming at 30","authors":"Andrew Cropper, Sebastijan Dumancic, Richard Evans, Stephen H Muggleton","year":"2022","venue":"Mach. Learn","doi":null,"url":null,"internal_url":null},{"position":36,"raw":"[de Sousa et al., 2021] Reudismam Rolim de Sousa, Gustavo Soares, Rohit Gheyi, Titus Barik, and Loris D'Antoni. Learning quick fixes from code repositories. In SBES. ACM, 2021.","title":"Learning quick fixes from code repositories","authors":"De Sousa","year":"2021","venue":"SBES. ACM","doi":null,"url":null,"internal_url":null},{"position":37,"raw":"[Dong et al., 2022] Rui Dong, Zhicheng Huang, Ian Iong Lam, Yan Chen, and Xinyu Wang. Webrobot: Web robotic process automation using interactive programming- by-demonstration. In PLDI. ACM, 2022.","title":"Webrobot: Web robotic process automation using interactive programmingby-demonstration","authors":"Rui Dong, Zhicheng Huang, Ian Iong Lam, Yan Chen, Xinyu Wang","year":"2022","venue":"PLDI","doi":null,"url":null,"internal_url":null},{"position":38,"raw":"[Ellis et al., 2021] Kevin Ellis, Catherine Wong, Maxwell Nye, Mathias Sablé-Meyer, Lucas Morales, Luke Hewitt, Luc Cary, Armando Solar-Lezama, and Joshua B. Tenen- baum. Dreamcoder: Bootstrapping inductive program syn- thesis with wake-sleep library learning. In PLDI. ACM, 2021.","title":"Dreamcoder: Bootstrapping inductive program synthesis with wake-sleep library learning","authors":"Kevin Ellis, Catherine Wong, Maxwell Nye, Mathias Sablé-Meyer, Lucas Morales, Luke Hewitt, Luc Cary, Armando Solar-Lezama, Joshua B Tenenbaum","year":"2021","venue":"PLDI","doi":null,"url":null,"internal_url":null},{"position":39,"raw":"[Feng and Muggleton, 1992] Cao Feng and Stephen H. Mug- gleton. Towards inductive generalization in higher order logic. In ML. Morgan Kaufmann, 1992.","title":"Muggleton. Towards inductive generalization in higher order logic","authors":"Cao Feng, H Stephen","year":"1992","venue":null,"doi":null,"url":null,"internal_url":null},{"position":40,"raw":"[Feser et al., 2015] John K. Feser, Swarat Chaudhuri, and Isil Dillig. Synthesizing data structure transformations from input-output examples. In PLDI. ACM, 2015.","title":"Synthesizing data structure transformations from input-output examples","authors":"John K Feser, Swarat Chaudhuri, Isil Dillig","year":"2015","venue":"PLDI","doi":null,"url":null,"internal_url":null},{"position":41,"raw":"[Galitsky, 2019] Boris Galitsky. Developing Enterprise Chat- bots -Learning Linguistic Structures. Springer, 2019.","title":"Developing Enterprise Chatbots -Learning Linguistic Structures","authors":"Boris Galitsky","year":"2019","venue":null,"doi":null,"url":null,"internal_url":null},{"position":42,"raw":"[Guhe et al., 2011] Markus Guhe, Alison Pease, Alan Smaill, Maricarmen Martinez, Martin Schmidt, Helmar Gust, Kai- Uwe Kühnberger, and Ulf Krumnack. A computational account of conceptual blending in basic mathematics. Cog- nitive Systems Research, 12(3):249-265, 2011.","title":"A computational account of conceptual blending in basic mathematics","authors":"Markus Guhe, Alison Pease, Alan Smaill, Maricarmen Martinez, Martin Schmidt, Helmar Gust, Kai-Uwe Kühnberger, Ulf Krumnack","year":"2011","venue":"Cognitive Systems Research","doi":null,"url":null,"internal_url":null},{"position":43,"raw":"[Gulwani, 2011] Sumit Gulwani. Automating string process- ing in spreadsheets using input-output examples. In POPL. ACM, 2011.","title":"Automating string processing in spreadsheets using input-output examples","authors":"Sumit Gulwani","year":"2011","venue":"POPL. ACM","doi":null,"url":null,"internal_url":null},{"position":44,"raw":"[Gulwani, 2016] Sumit Gulwani. Programming by examples -and its applications in data wrangling. In NATO Science for Peace and Security Series, volume 45. IOS Press, 2016.","title":"Programming by examples -and its applications in data wrangling","authors":"Sumit Gulwani","year":"2016","venue":"NATO Science for Peace and Security Series","doi":null,"url":null,"internal_url":null},{"position":45,"raw":"[Hasker, 1995] Robert W. Hasker. The Replay Of Program Derivations. PhD thesis, University of Illinois at Urbana- Champaign, 1995.","title":"The Replay Of Program Derivations","authors":"Robert W Hasker","year":"1995","venue":null,"doi":null,"url":null,"internal_url":null},{"position":46,"raw":"[Hofmann, 2010] Martin Hofmann. Igor2 -an analytical in- ductive functional programming system: Tool demo. In PEPM. ACM, 2010.","title":"Igor2 -an analytical inductive functional programming system: Tool demo","authors":"Martin Hofmann","year":"2010","venue":"PEPM. ACM","doi":null,"url":null,"internal_url":null},{"position":47,"raw":"[Huet, 1976] Gerard Huet. Résolution d' Équations dans des langages d'ordre 1, 2, . . . , ω. These d' État, Université de Paris VII, 1976.","title":"Résolution d' Équations dans des langages d'ordre 1","authors":"Gerard Huet, Huet","year":"1976","venue":null,"doi":null,"url":null,"internal_url":null},{"position":48,"raw":"[Idestam-Almquist, 1995] Peter Idestam-Almquist. General- ization of clauses under implication. J. Artif. Int. Res., 3(1):467-489, 1995.","title":"Peter Idestam-Almquist. Generalization of clauses under implication","authors":"Idestam-Almquist","year":"1995","venue":"J. Artif. Int. Res","doi":null,"url":null,"internal_url":null},{"position":49,"raw":"[Idestam-Almquist, 1997] Peter Idestam-Almquist. Gener- alization of clauses relative to a theory. Mach. Learn., 26(2-3):213-226, 1997.","title":"Peter Idestam-Almquist. Generalization of clauses relative to a theory","authors":"Idestam-Almquist","year":"1997","venue":"Mach. Learn","doi":null,"url":null,"internal_url":null},{"position":50,"raw":"[Johansson et al., 2011] Moa Johansson, Lucas Dixon, and Alan Bundy. Conjecture synthesis for inductive theories. J. Autom. Reason., 47(3):251-289, 2011.","title":"Conjecture synthesis for inductive theories","authors":"Johansson","year":"2011","venue":"J. Autom. Reason","doi":null,"url":null,"internal_url":null},{"position":51,"raw":"[Jung et al., 2020] Jean Christoph Jung, Carsten Lutz, and Frank Wolter. Least general generalizations in description logic: Verification and existence. In AAAI. AAAI Press, 2020.","title":"Least general generalizations in description logic: Verification and existence","authors":"Jung","year":"2020","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":52,"raw":"[Kitzelmann and Schmid, 2006] Emanuel Kitzelmann and Ute Schmid. Inductive synthesis of functional programs: An explanation based generalization approach. J. Mach. Learn. Res., 7:429-454, 2006.","title":"Emanuel Kitzelmann and Ute Schmid. Inductive synthesis of functional programs: An explanation based generalization approach","authors":"Schmid Kitzelmann","year":"2006","venue":"J. Mach. Learn. Res","doi":null,"url":null,"internal_url":null},{"position":53,"raw":"[Konev and Kutsia, 2016] Boris Konev and Temur Kutsia. Anti-unification of concepts in description logic EL. In KR. AAAI Press, 2016.","title":"Anti-unification of concepts in description logic EL","authors":"Kutsia Konev, Boris Konev, Temur Kutsia","year":"2016","venue":null,"doi":null,"url":null,"internal_url":null},{"position":54,"raw":"[Krumnack et al., 2007] Ulf Krumnack, Angela Schwering, Helmar Gust, and Kai-Uwe Kühnberger. Restricted higher- order anti-unification for analogy making. In AI, LNCS, 2007.","title":"Restricted higherorder anti-unification for analogy making","authors":"Krumnack","year":"2007","venue":"AI, LNCS","doi":null,"url":null,"internal_url":null},{"position":55,"raw":"[Küsters and Molitor, 2001] Ralf Küsters and Ralf Molitor. Computing least common subsumers in ALEN. In IJCAI.","title":"Computing least common subsumers in ALEN","authors":"Ralf Küsters, Ralf Molitor","year":null,"venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2001/31"},{"position":56,"raw":"Morgan Kaufmann, 2001.","title":null,"authors":"Morgan Kaufmann","year":"2001","venue":null,"doi":null,"url":null,"internal_url":null},{"position":57,"raw":"[Kutsia and Pau, 2022] Temur Kutsia and Cleo Pau. A frame- work for approximate generalization in quantitative theories. In IJCAR, LNCS, 2022.","title":"Temur Kutsia and Cleo Pau. A framework for approximate generalization in quantitative theories","authors":"Pau Kutsia","year":"2022","venue":"IJCAR, LNCS","doi":null,"url":null,"internal_url":null},{"position":58,"raw":"[Kutsia et al., 2014] Temur Kutsia, Jordi Levy, and Mateu Villaret. Anti-unification for unranked terms and hedges. J. Autom. Reason., 52(2):155-190, 2014.","title":"Anti-unification for unranked terms and hedges","authors":"Temur Kutsia, Jordi Levy, Mateu Villaret","year":"2014","venue":"J. Autom. Reason","doi":null,"url":null,"internal_url":null},{"position":59,"raw":"[Kuzelka et al., 2012] Ondrej Kuzelka, Andrea Szabóová, and Filip Zelezný. Bounded least general generalization. In ILP, LNCS, 2012.","title":"Bounded least general generalization","authors":"Kuzelka","year":"2012","venue":"ILP, LNCS","doi":null,"url":null,"internal_url":null},{"position":60,"raw":"[Li and Thompson, 2010] Huiqing Li and Simon J. Thomp- son. Similar code detection and elimination for erlang programs. In PADL, LNCS, 2010.","title":"Similar code detection and elimination for erlang programs","authors":"Huiqing Li, Simon J Thompson","year":"2010","venue":"PADL, LNCS","doi":null,"url":null,"internal_url":null},{"position":61,"raw":"[Libal and Miller, 2022] Tomer Libal and Dale Miller. Functions-as-constructors higher-order unification: ex- tended pattern unification. Ann. Math. Artif. Intell., 90(5):455-479, 2022.","title":"Functions-as-constructors higher-order unification: extended pattern unification","authors":"Miller Libal, Tomer Libal, Dale Miller","year":"2022","venue":"Ann. Math. Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":62,"raw":"[Lu et al., 2000] Jianguo Lu, John Mylopoulos, Masateru Harao, and Masami Hagiyab. Higher order generaliza- tion and its application in program verification. Ann. Math. Artif. Intell., 28(1-4):107-126, 2000.","title":"Higher order generalization and its application in program verification","authors":"Jianguo Lu, John Mylopoulos, Masateru Harao, Masami Hagiyab","year":"2000","venue":"Ann. Math. Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":63,"raw":"[Martínez et al., 2017] Maricarmen Martínez, Ahmed M. H. Abdel-Fattah, Ulf Krumnack, Danny Gómez-Ramírez, Alan Smaill, Tarek Richard Besold, Alison Pease, Martin Schmidt, Markus Guhe, and Kai-Uwe Kühnberger. Theory blending: extended algorithmic aspects and examples. Ann. Math. Artif. Intell., 80(1):65-89, 2017.","title":"Theory blending: extended algorithmic aspects and examples","authors":"Maricarmen Martínez, M H Ahmed, Ulf Abdel-Fattah, Danny Krumnack, Alan Gómez-Ramírez, Smaill, Richard Tarek, Alison Besold, Martin Pease, Markus Schmidt, Kai-Uwe Guhe, Kühnberger","year":"2017","venue":"Ann. Math. Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":64,"raw":"[Mehta et al., 2020] Sonu Mehta, Ranjita Bhagwan, Rahul Kumar, Chetan Bansal, Chandra Shekhar Maddila, Bala- subramanyan Ashok, Sumit Asthana, Christian Bird, and Aditya Kumar. Rex: Preventing bugs and misconfigura- tion in large services using correlated change analysis. In USENIX. USENIX Association, 2020.","title":"Rex: Preventing bugs and misconfiguration in large services using correlated change analysis","authors":"Sonu Mehta, Ranjita Bhagwan, Rahul Kumar, Chetan Bansal, Chandra Shekhar Maddila, Balasubramanyan Ashok, Sumit Asthana, Christian Bird, Aditya Kumar","year":"2020","venue":"USENIX. USENIX Association","doi":null,"url":null,"internal_url":null},{"position":65,"raw":"[Mitchell, 1982] Tom M. Mitchell. Generalization as search. Artificial Intelligence, 18(2):203-226, 1982.","title":"Generalization as search","authors":"Tom M Mitchell","year":"1982","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":66,"raw":"[Muggleton et al., 2009] Stephen H. Muggleton, José Car- los Almeida Santos, and Alireza Tamaddoni-Nezhad. Pro- Golem: A system based on relative minimal generalisation. In ILP, LNCS, 2009.","title":"Pro-Golem: A system based on relative minimal generalisation","authors":"H Stephen, José Muggleton, Carlos Almeida Santos, Alireza Tamaddoni-Nezhad","year":"2009","venue":"ILP, LNCS","doi":null,"url":null,"internal_url":null},{"position":67,"raw":"[Muggleton, 1995] Stephen H. Muggleton. Inverse entail- ment and Progol. New Gener. Comput., 13(3&4):245-286, 1995.","title":"Inverse entailment and Progol","authors":"H Stephen, Muggleton","year":"1995","venue":"New Gener. Comput","doi":null,"url":null,"internal_url":null},{"position":68,"raw":"[Ontañón and Plaza, 2007] Santiago Ontañón and Enric Plaza. Case-based learning from proactive communica- tion. In IJCAI. ijcai.org, 2007.","title":"Santiago Ontañón and Enric Plaza. Case-based learning from proactive communication","authors":"Plaza Ontañón","year":"2007","venue":"IJCAI. ijcai.org","doi":null,"url":null,"internal_url":null},{"position":69,"raw":"[Pau, 2022] Cleo Pau. Symbolic Techniques for Approximate Reasoning. PhD thesis, RISC, Johannes Kepler University Linz, 2022.","title":"Cleo Pau. Symbolic Techniques for Approximate Reasoning","authors":"Pau","year":"2022","venue":null,"doi":null,"url":null,"internal_url":null},{"position":70,"raw":"[Pfenning, 1991] Frank Pfenning. Unification and anti- unification in the calculus of constructions. In LICS. IEEE Computer Society, 1991.","title":"Unification and antiunification in the calculus of constructions","authors":"Frank Pfenning","year":"1991","venue":"LICS. IEEE Computer Society","doi":null,"url":null,"internal_url":null},{"position":71,"raw":"[Pientka, 2009] Brigitte Pientka. Higher-order term index- ing using substitution trees. ACM Trans. Comput. Log., 11(1):6:1-6:40, 2009.","title":"Higher-order term indexing using substitution trees","authors":"Brigitte Pientka, Pientka","year":"2009","venue":"ACM Trans. Comput. Log","doi":null,"url":null,"internal_url":null},{"position":72,"raw":"[Plotkin, 1970] Gordon D. Plotkin. A note on inductive gen- eralization. Machine Intell., 5(1):153-163, 1970.","title":"A note on inductive generalization","authors":"Gordon D Plotkin","year":"1970","venue":"Machine Intell","doi":null,"url":null,"internal_url":null},{"position":73,"raw":"[Polozov and Gulwani, 2015] Oleksandr Polozov and Sumit Gulwani. Flashmeta: A framework for inductive program synthesis. SIGPLAN Not., 50(10):107-126, 2015.","title":"Flashmeta: A framework for inductive program synthesis","authors":"Oleksandr Polozov, Sumit Gulwani","year":"2015","venue":"SIGPLAN Not","doi":null,"url":null,"internal_url":null},{"position":74,"raw":"[Purgal et al., 2022] Stanislaw J. Purgal, David M. Cerna, and Cezary Kaliszyk. Learning higher-order logic programs from failures. In IJCAI. ijcai.org, 2022.","title":"Learning higher-order logic programs from failures","authors":"Stanislaw J Purgal, David M Cerna, Cezary Kaliszyk","year":"2022","venue":"IJCAI. ijcai.org","doi":null,"url":null,"internal_url":"/proceedings/2022/378"},{"position":75,"raw":"[Raza et al., 2014] Mohammad Raza, Sumit Gulwani, and Natasa Milic-Frayling. Programming by example using least general generalizations. In AAAI. AAAI Press, 2014.","title":"Programming by example using least general generalizations","authors":"Mohammad Raza, Sumit Gulwani, Natasa Milic-Frayling","year":"2014","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":76,"raw":"[Reynolds, 1970] John C. Reynolds. Transformational sys- tems and the algebraic structure of atomic formulas. Ma- chine Intell., 5(1):135-151, 1970.","title":"Transformational systems and the algebraic structure of atomic formulas","authors":"John C Reynolds","year":"1970","venue":"Machine Intell","doi":null,"url":null,"internal_url":null},{"position":77,"raw":"[Sakkas et al., 2020] Georgios Sakkas, Madeline Endres, Benjamin Cosman, Westley Weimer, and Ranjit Jhala. Type error feedback via analytic program repair. In PLDI. ACM, 2020.","title":"Type error feedback via analytic program repair","authors":"Georgios Sakkas, Madeline Endres, Benjamin Cosman, Westley Weimer, Ranjit Jhala","year":"2020","venue":"PLDI. ACM","doi":null,"url":null,"internal_url":null},{"position":78,"raw":"[Schmidt-Schauß and Nantes-Sobrinho, 2022] Manfred Schmidt-Schauß and Daniele Nantes-Sobrinho. Nominal anti-unification with atom-variables. In FSCD, LIPIcs, 2022.","title":"Nominal anti-unification with atom-variables","authors":"Nantes-Sobrinho ; Schmidt-Schauß, Manfred Schmidt-Schauß, Daniele Nantes-Sobrinho","year":"2022","venue":"FSCD, LIPIcs","doi":null,"url":null,"internal_url":null},{"position":79,"raw":"[Schwering et al., 2009] Angela Schwering, Ulf Krumnack, Kai-Uwe Kühnberger, and Helmar Gust. Syntactic princi- ples of heuristic-driven theory projection. Cognitive Sys- tems Research, 10(3):251-269, 2009.","title":"Syntactic principles of heuristic-driven theory projection","authors":"Angela Schwering, Ulf Krumnack, Kai-Uwe Kühnberger, Helmar Gust","year":"2009","venue":"Cognitive Systems Research","doi":null,"url":null,"internal_url":null},{"position":80,"raw":"[Siddiq et al., 2021] Mohammed Latif Siddiq, Md. Rezwa- nur Rahman Jahin, Mohammad Rafid Ul Islam, Rifat Shahriyar, and Anindya Iqbal. SQLIFIX: Learning based approach to fix SQL injection vulnerabilities in source code. In SANER. IEEE, 2021.","title":"SQLIFIX: Learning based approach to fix SQL injection vulnerabilities in source code","authors":"Mohammed Latif Siddiq, Md Rezwanur Rahman Jahin, Mohammad Rafid, Ul Islam, Rifat Shahriyar, Anindya Iqbal","year":"2021","venue":"SANER. IEEE","doi":null,"url":null,"internal_url":null},{"position":81,"raw":"[Singher and Itzhaky, 2021] Eytan Singher and Shachar Itzhaky. Theory exploration powered by deductive syn- thesis. In CAV, LNCS, 2021.","title":"Theory exploration powered by deductive synthesis","authors":"Itzhaky Singher, Eytan Singher, Shachar Itzhaky","year":"2021","venue":"CAV, LNCS","doi":null,"url":null,"internal_url":null},{"position":82,"raw":"[Sinha, 2008] Nishant Sinha. Symbolic program analysis using term rewriting and generalization. In FMCAD. IEEE, 2008.","title":"Symbolic program analysis using term rewriting and generalization","authors":"Nishant Sinha","year":"2008","venue":"FMCAD. IEEE","doi":null,"url":null,"internal_url":null},{"position":83,"raw":"[Sotoudeh and Thakur, 2020] Matthew Sotoudeh and Aditya V. Thakur. Analogy-making as a core primitive in the software engineering toolbox. In Onward! ACM, 2020.","title":"Analogy-making as a core primitive in the software engineering toolbox","authors":"Thakur Sotoudeh, Matthew Sotoudeh, Aditya V Thakur","year":"2020","venue":"Onward! ACM","doi":null,"url":null,"internal_url":null},{"position":84,"raw":"[Srinivasan, 2001] Ashwin Srinivasan. The ALEPH manual. Machine Learning at the Computing Laboratory, Oxford University, 2001.","title":"The ALEPH manual","authors":"Ashwin Srinivasan","year":"2001","venue":"Machine Learning at the Computing Laboratory","doi":null,"url":null,"internal_url":null},{"position":85,"raw":"[Vanhoof and Yernaux, 2019] Wim Vanhoof and Gonzague Yernaux. Generalization-driven semantic clone detection in CLP. In LOPSTR, LNCS, 2019.","title":"Generalization-driven semantic clone detection in CLP","authors":"Yernaux Vanhoof, Wim Vanhoof, Gonzague Yernaux","year":"2019","venue":"LOPSTR, LNCS","doi":null,"url":null,"internal_url":null},{"position":86,"raw":"[Weller and Schmid, 2006] Stephan Weller and Ute Schmid. Solving proportional analogies by E -generalization. In KI, LNCS, 2006.","title":"Solving proportional analogies by E -generalization","authors":"Schmid Weller, Stephan Weller, Ute Schmid","year":"2006","venue":"KI, LNCS","doi":null,"url":null,"internal_url":null},{"position":87,"raw":"[Winter et al., 2022] Emily Rowan Winter, Vesna Nowack, David Bowes, Steve Counsell, Tracy Hall, Sæ- mundur Óskar Haraldsson, John R. Woodward, Serkan Kirbas, Etienne Windels, Olayori McBello, Abdurahman Atakishiyev, Kevin Kells, and Matthew W. Pagano. To- wards developer-centered automatic program repair: find- ings from Bloomberg. In ESEC/FSE. ACM, 2022.","title":"Towards developer-centered automatic program repair: findings from Bloomberg","authors":"Emily Rowan Winter, Vesna Nowack, David Bowes, Steve Counsell, Tracy Hall, Sæmundur Óskar Haraldsson, John R Woodward, Serkan Kirbas, Etienne Windels, Olayori Mcbello, Abdurahman Atakishiyev, Kevin Kells, Matthew W Pagano","year":"2022","venue":"ESEC/FSE","doi":null,"url":null,"internal_url":null},{"position":88,"raw":"[Yamamoto et al., 2001] Akihiro Yamamoto, Kimihito Ito, Akira Ishino, and Hiroki Arimura. Modelling semi- structured documents with hedges for deduction and in- duction. In ILP, LNCS, 2001.","title":"Modelling semistructured documents with hedges for deduction and induction","authors":"Akihiro Yamamoto, Kimihito Ito, Akira Ishino, Hiroki Arimura","year":"2001","venue":"ILP, LNCS","doi":null,"url":null,"internal_url":null},{"position":89,"raw":"[Yang and Deng, 2021] Kaiyu Yang and Jia Deng. Learn- ing symbolic rules for reasoning in quasi-natural language. CoRR, abs/2111.12038, 2021.","title":"Learning symbolic rules for reasoning in quasi-natural language","authors":"Kaiyu Yang, Jia Deng","year":"2021","venue":null,"doi":null,"url":null,"internal_url":null},{"position":90,"raw":"[Yernaux and Vanhoof, 2022a] Gonzague Yernaux and Wim Vanhoof. Anti-unification of unordered goals. In EACSL, LIPIcs, 2022.","title":"Anti-unification of unordered goals","authors":"Vanhoof Yernaux, Gonzague Yernaux, Wim Vanhoof","year":"2022","venue":"EACSL","doi":null,"url":null,"internal_url":null},{"position":91,"raw":"[Yernaux and Vanhoof, 2022b] Gonzague Yernaux and Wim Vanhoof. On detecting semantic clones in constraint logic programs. In IWSC. IEEE, 2022.","title":"On detecting semantic clones in constraint logic programs","authors":"Vanhoof Yernaux, Gonzague Yernaux, Wim Vanhoof","year":"2022","venue":"IWSC. IEEE","doi":null,"url":null,"internal_url":null},{"position":92,"raw":"[Zhang et al., 2022] Yuhao Zhang, Yasharth Bajpai, Priyan- shu Gupta, Ameya Ketkar, Miltiadis Allamanis, Titus Barik, Sumit Gulwani, Arjun Radhakrishna, Mohammad Raza, Gustavo Soares, and Ashish Tiwari. Overwatch: Learn- ing patterns in code edit sequences. Proc. ACM Program. Lang., 6(OOPSLA), 2022.","title":"Overwatch: Learning patterns in code edit sequences","authors":"Yuhao Zhang, Yasharth Bajpai, Priyanshu Gupta, Ameya Ketkar, Miltiadis Allamanis, Titus Barik, Sumit Gulwani, Arjun Radhakrishna, Mohammad Raza, Gustavo Soares, Ashish Tiwari","year":"2022","venue":"Proc. ACM Program. Lang","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}