Properties of Constrained Generalization Algorithms
Résumé
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.
Domaines
Intelligence artificielle [cs.AI]
Fichier principal
Properties_of_Constrained_Generalization_Algorithms.pdf (417.25 Ko)
Télécharger le fichier
Origine | Fichiers éditeurs autorisés sur une archive ouverte |
---|
Loading...