Anti-unification and Generalization: A Survey
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 16 of its 99 references that are in the map. First posted on arXiv 1 Feb 2023.
Builds on
16 of 99 references.
References · 16
- 2020Learning programs by learning from failurescited by 73
- 2022Top-Down Synthesis for Library Learningcited by 57
- 2021Inductive logic programming at 30cited by 46
- 2019Getafix: Learning to Fix Bugs Automaticallycited by 40
- 2022babble: Learning Better Abstractions with E-Graphs and Anti-Unificationcited by 22
- 2021Learning Higher-Order Programs without Meta-Interpretive Learningcited by 14
- 2021Learning Symbolic Rules for Reasoning in Quasi-Natural Languagecited by 9
- 2018Learning Quick Fixes from Code Repositoriescited by 8
- 2022Overwatch: Learning Patterns in Code Edit Sequencescited by 8
- 2022WebRobot: Web Robotic Process Automation using Interactive Programming-by-Demonstrationcited by 7
- 2023Generalisation Through Negation and Predicate Inventioncited by 5
- 2014E-Generalization Using Grammarscited by 3
4 more
- 2020Theory Exploration Powered By Deductive Synthesiscited by 3
- 2020Analogy-Making as a Core Primitive in the Software Engineering Toolboxcited by 1
- 2021Proof-Carrying Parameters in Certified Symbolic Execution: The Case Study of Antiunificationcited by 1
- 2022One or Nothing: Anti-unification over the Simply-Typed Lambda Calculuscited by 1
Built on by
Citing papers per year: 2023: 3; 2024: 1; 2025: 0; 2026: 3.
7 papers.
- 2023Reinforcement Learning and Data-Generation for Syntax-Guided Synthesiscited by 3
- 2023Generalization-baed similaritycited by 2
- 2026Library learning with e-graphs on jazz harmonycited by 1
- 2026From Solvers to Research: Large Language Model-Driven Formal Mathematics at the Research Frontiercited by 1
- 2023Bilingual analogical proportions via hedgescited by 0
- 2024Algebraic anti-unificationcited by 0
- 2026LeanPolish: Verified Supervision for Lean Proof Compressioncited by 0
- 2026LeanPolish: Verified Supervision for Lean Proof Compression29 Sep 2026
- 2026From Solvers to Research: Large Language Model-Driven Formal Mathematics at the Research Frontier8 Jul 2026
- 2026Library learning with e-graphs on jazz harmony6 May 2026
- 2024Algebraic anti-unification22 Jul 2024
- 2023Reinforcement Learning and Data-Generation for Syntax-Guided Synthesis13 Jul 2023
- 2023Bilingual analogical proportions via hedges2 May 2023
- 2023Generalization-baed similarity13 Feb 2023