Computing Least Generalization by Anti-combination
Mikio Yoshida and Chiaki Sakama
Proceedings of the 24th International Conference on Inductive Logic Programming (ILP 2014),
Nancy, France, September 2014.
This paper provides a new method of computing a least generalization of terms.
Using the technique of combination of substitutions,
we introduce the notion of anti-combination which is the inverse substitution of combination.
We then show that anti-combination is used for producing a least generalization of terms.
Extended Abstract (PDF 100K)