Higher Order Generalization
Workshop Paper, JELIA '98 European Workshop on Logics in Artificial Intelligence, pp. 368 - 381, October, 1998
Abstract
Generalization is a fundamental operation of inductive inference. While first order syntactic generalization (anti-unification) is well understood, its various extensions are needed in applications. This paper discusses syntactic higher order generalization in a higher order language λ2[1]. Based on the application ordering, we proved the least general generalization exists and is unique up to renaming. An algorithm to compute the least general generalization is presented.
BibTeX
@workshop{Lu-1998-14781,author = {Jianguo Lu and M. Harao and M. Hagiya},
title = {Higher Order Generalization},
booktitle = {Proceedings of JELIA '98 European Workshop on Logics in Artificial Intelligence},
year = {1998},
month = {October},
pages = {368 - 381},
}
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.