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.
Type de document :
Communication dans un congrès
GCAI 2017. 3rd Global Conference on Artificial Intelligence, Oct 2017, Miami, United States
Liste complète des métadonnées

Littérature citée [13 références]  Voir  Masquer  Télécharger

http://hal.univ-grenoble-alpes.fr/hal-01636608
Contributeur : Thierry Boy de La Tour <>
Soumis le : jeudi 16 novembre 2017 - 17:14:45
Dernière modification le : jeudi 11 janvier 2018 - 06:27:34

Fichier

Properties_of_Constrained_Gene...
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

  • HAL Id : hal-01636608, version 1

Collections

Citation

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〉

Partager

Métriques

Consultations de la notice

31

Téléchargements de fichiers

10