Abstract
In this paper the notion of unifier is extended to the infinite set case. The proof of existence of the most general unifier of any infinite, unifiable set of types (terms) is presented. Learning procedure, based on infinite set unification, is described.
Similar content being viewed by others
References
W. Buszkowski, 1987, Solvable Problems for Classical Categorial Grammars, Bull. Pol. Acad. Scie. Math. 35, 373-382.
W. Buszkowski, Discovery Procedures for Categorial Grammars, in [7]
J. van Benthem, Categorial Equations, in [7].
W. Buszkowski and G. Penn, 1990, Categorial Grammars Determined from Linguistic Data by Unification, Studia Logica XLIX,4, 431-454.
M. Kanazawa, 1996, Identification in the Limit of Categorial Grammars, Journal of Logic, Language and Information, 5,No 2.
M. Kanazawa, 1994, Learnable Classes of Categorial Grammars, Dissertation, Stanford University.
E. Klein and J. van Benthem (eds), 1987, Categories, Polymorphism an Unification, Universiteit van Amsterdam, Amsterdam.
J. W. Lloyd, 1987, Foundations of Logic Programming, Sprringer-Verlag, Berlin.
J. Marciniec, 1994, Learning Categorial Grammars by Uniffcation with Negative Constraints, Journal of Applied Non-Classical Logics 4, 181-200.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Marciniec, J. Infinite Set Unification with Application to Categorial Grammar. Studia Logica 58, 339–355 (1997). https://doi.org/10.1023/A:1004926032425
Issue Date:
DOI: https://doi.org/10.1023/A:1004926032425