# E-Generalization Using Grammars

arXiv: https://arxiv.org/abs/1403.8118 · HTML: https://mlsanity.com/paper/1403.8118/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 28 Mar 2014.

## Built on by (most cited first, 3 of 3)

- [Anti-unification and Generalization: A Survey](https://mlsanity.com/paper/2302.00277/) (2023)
- [KitBit: A New AI Model for Solving Intelligence Tests and Numerical Series](https://mlsanity.com/paper/2206.08965/) (2022)
- [Algebraic anti-unification](https://mlsanity.com/paper/2407.15510/) (2024)

## Abstract (arXiv)

We extend the notion of anti-unification to cover equational theories and present a method based on regular tree grammars to compute a finite representation of E-generalization sets. We present a framework to combine Inductive Logic Programming and E-generalization that includes an extension of Plotkin's lgg theorem to the equational case. We demonstrate the potential power of E-generalization by three example applications: computation of suggestions for auxiliary lemmas in equational inductive proofs, computation of construction laws for given term sequences, and learning of screen editor command sequences.