Infinite Set Unification with Application to Categorial Grammar

Studia Logica

Volumn 58, Issue 3, 1997, Pages 339-355

  Marciniec, Jacek ^a  

^a ADAM MICKIEWICZ UNIVERSITY   (Poland)

Author keywords

Categorial grammar; Discovery procedure; Unification

Indexed keywords

EID: 33645495131     PISSN: 00393215     EISSN: 15728730     Source Type: Journal    
DOI: 10.1023/A:1004926032425     Document Type: Article

References (9)

1. W. BUSZKOWSKI, 1987, Solvable Problems for Classical Categorial Grammars, Bull. Pol. Acad. Scie. Math. 35, 373-382.
2. W. BUSZKOWSKI, Discovery Procedures for Categorial Grammars, in [7]
3. J. VAN BENTHEM, Categorial Equations, in [7].
4. W. BUSZKOWSKI and G. PENN, 1990, Categorial Grammars Determined from Linguistic Data by Unification, Studia, Logica XLIX, 4, 431-454.
5. M. KANAZAWA, 1996, Identification in the Limit of Categorial Grammars, Journal of Logic, Language and Information, 5, No 2.
6. M. KANAZAWA, 1994, Learnable Classes of Categorial Grammars, Dissertation, Stanford University.
7. E. KLEIN and J. VAN BENTHEM (eds), 1987, Categories, Polymorphism an Unification, Universiteit van Amsterdam, Amsterdam.
8. J. W. LLOYD, 1987, Foundations of Logic Programming, Sprringer-Verlag, Berlin.
9. J. MARCINIEC, 1994, Learning Categorial Grammars by Unification with Negative Constraints, Journal of Applied Non-Classical Logics 4, 181-200.