Optimal Unification of Infinite Sets of Types

Authors:
Jacek Marciniec
Affiliations:
Faculty of Mathematics and Computer Science, Adam Mickiewicz University, Umultowska 87, 61-614 Poznań, Poland
Venue:
Fundamenta Informaticae
Year:
2004

Citing 3
Cited 5

Systems that learn: an introduction to learning theory for cognitive and computer scientists

Systems that learn: an introduction to learning theory for cognitive and computer scientists
Learnable classes of categorial grammars

Learnable classes of categorial grammars
Connected Sets of Types and Categorial Consequence

LACL '96 Selected papers from the First International Conference on Logical Aspects of Computational Linguistics

Rough Sets and Learning by Unification

Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
From Unification Compactness to Learnability

Fundamenta Informaticae
Tarski's principle, categorial grammars and learnability

LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Rough Sets and Learning by Unification

Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
From Unification Compactness to Learnability

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we focus on the properties of infinite sets of types that have finite substitutional images. Since the number of such images may be infinite, we provide the way of its reduction. Having this done, we apply the new methods in the field of learnability of classical categorial grammars.