Properties of Constrained Generalization Algorithms

14 pages•Published: October 19, 2017

Abstract

Two non deterministic algorithms for generalizing a solution of a constraint expressed in second order typed lambda-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.

Keyphrases: generalization, second order constraints, typed lambda calculus

In: Christoph Benzmüller, Christine Lisetti and Martin Theobald (editors). GCAI 2017. 3rd Global Conference on Artificial Intelligence, vol 50, pages 64-77.

Links:	https://easychair.org/publications/paper/R4mG
	https://doi.org/10.29007/xtb8

BibTeX entry

@inproceedings{GCAI2017:Properties_Constrained_Generalization_Algorithms,
  author    = {Thierry Boy de La Tour},
  title     = {Properties of Constrained Generalization Algorithms},
  booktitle = {GCAI 2017. 3rd Global Conference on Artificial Intelligence},
  editor    = {Christoph Benzmüller and Christine Lisetti and Martin Theobald},
  series    = {EPiC Series in Computing},
  volume    = {50},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/R4mG},
  doi       = {10.29007/xtb8},
  pages     = {64-77},
  year      = {2017}}

Download PDF Open PDF in browser