References
- Ajdukiewicz, K. (1935). Die syntaktische Konnexit¨at. Studia Philosophica, 1, 1-27.
- Buszkowski, W. (1987). Solvable problems for classical categorial grammars. Bulletin of the Polish Academy of Sciences, Mathematics, 35, 373-382.
- Buszkowski, W., & Dziemidowicz, B. (2000). Restricted optimal unification. In: Hamamatsu, Y., Kosicki, W., Polkowski, L., Toho, M., & Yonekura, T. (Eds.), Formal Methods and Intelligent Techniques in Control, Desicion Making, Multimedia and Robotics, 1-8.
- Buszkowski,W., & Penn, G. (1990). Categorial grammars determined from linguistic data by unification. Studia Logica, 49, 431-454.
- Doets, K. (1994). From Logic to Logic Programming, Cambridge,Mass.: MIT Press.
- Dziemidowicz, B. (2002). Optimal unification and learning algorithms for categorial grammars. Fundamenta Informaticae, 49, 297-308.
- Dziemidowicz, B. (2007). On learnability of restricted classes of categorial grammars. Studia Logica, 85, 153-169.
- Gold, E. M. (1967). Language identification in the limit. Information and Control, 10, 447-474.
- Kanazawa, M. (1996). Identification in the limit of categorial grammars. Journal of Logic, Language and Information, 5, 115-155.
- Kanazawa, M. (1998). Learnable classes of categorial grammars. Stanford: CSLI Publications FoLLI.
- Kapur, S. (1991). Computational learning of languages. Ph. D. disseration, Available as technical raport, 91-1234, Cornel University.
- Lloyd, J. W. (1987). Foundations of Logic Programming, Berlin: Springer.
- Marciniec, J. (1994). Learning categorial grammars by unification with negative constraints. Journal of Applied Non-Classical Logics, 4, 181-200.
- Marciniec, J. (1997). The method of unification in procedures of determining categorial grammars (in Polish). Investigationes Linguisticae, 2, 45-96.
- Osheron, D., de Jongh, D., Martin, E., & Weinstein, S. (1997). Formal learning theory. In: van Benthen, J., & ter Meulen, A. ( Eds.), Handbook of Logic and Language, 737-775.