Properties of Constrained Generalization Algorithms

Abstract : Two non deterministic algorithms for generalizing a solution of a constraint expressed in second order typed λ-calculus are presented. One algorithm derives from the proof of completeness of the higher order unification rules by D. C. Jensen and T. Pietrzykowski, the other is abstracted from an algorithm by N. Peltier and the author for generalizing proofs. A framework is developed in which such constrained generalization algorithms can be designed, allowing a uniform presentation for the two algorithms. Their relative strength at generalization is then analyzed through some properties of interest: their behaviour on valid and first order constraints, or whether they may be iterated or composed.
Document type :
Conference papers
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download
Contributor : Thierry Boy de la Tour <>
Submitted on : Thursday, November 16, 2017 - 5:14:45 PM
Last modification on : Tuesday, April 2, 2019 - 1:47:58 AM
Long-term archiving on : Saturday, February 17, 2018 - 1:42:38 PM


Publisher files allowed on an open archive


  • HAL Id : hal-01636608, version 1



Thierry Boy de la Tour. Properties of Constrained Generalization Algorithms. GCAI 2017. 3rd Global Conference on Artificial Intelligence, Oct 2017, Miami, United States. ⟨hal-01636608⟩



Record views


Files downloads