This is a preview of subscription content, log in via an institution to check access.
Bibliography
Carpenter, R.: 1992,The Logic of Typed Feature Structures, Cambridge Tracts in Theoretical Computer Science 32, Cambridge University Press, Cambridge, England.
Chen, W. and D. S. Warren: 1989,Abductive Logic Programming, m.s., Department of Computer Science, State University of New York at Stony Brook.
Chomsky, N.: 1988,Some Notes on Economy of Derivation and Representation, m.s., Department of Linguistics and Philosophy, Massachusetts Institute of Technology.
Clark, K. L.: 1978, ‘Negation as Failure’, in H. Gallaire and J. Minker (eds.),Logic and Databases, Plenum Press, New York.
Colmerauer, A.: 1978, ‘Metamorphosis Grammars’, in Leonard Bloc (ed.),Natural Language Communication with Computers, Springer-Verlag, Berlin, Germany.
Fagin, R.: 1990, ‘Finite-Model Theory — a Personal Perspective’, in S. Abiteboul and P. C. Kannellakis (eds.),ICDT '90: 3rd International Conference on Database Theory, Springer-Verlag, New York.
Gallier, J.: 1986,Logic for Computer Science, Harper and Row, New York.
Höhfeld, M. and G. Smolka: 1988,Definite Relations over Constraint Languages, LILOG Report 53, IBM Deutschland, Stuttgart.
Johnson, M.: 1988,Attribute Value Logic and the Theory of Grammar, CSLI Lecture Notes Series, University of Chicago Press.
Johnson, M.: 1990a, ‘Expressing Disjunctive and Negative Feature Constraints in Classical First-Order Logic’,Proceedings of the 28th Annual Meeting of the Association for Computational Linguistics, Pittsburgh, Pennsylvania.
Johnson, M.: 1990b, ‘Features, Frames and Quantifier-Free Formulae’, in P. Saint-Dizier and S. Szpakowicz (eds.),Logic and Logic Grammars for Language Processing, Ellis Horwood, New York.
Johnson, M.: 1991a, ‘Features and Formulae’,Computational Linguistics 17(1), 131–152.
Johnson, M.: 1991b, ‘Logic and Feature Structures’,Proceedings of IJCAI-91, Sydney, Australia.
Johnson, M.: to appear, ‘Computing with Features as Formulae’,Computational Linguistics.
Kaplan, R. and J. Bresnan: 1982, ‘Lexical-Functional Grammar: A Formal System for Grammatical Representation’, in J. Bresnan (ed.),The Mental Representation of Grammatical Relations, The MIT Press.
Kasper, R. and W. Rounds: 1990, ‘The logic of Unification in Grammar’,Linguistics and Philosophy 13(1), 35–58.
Kay, M.: 1979, ‘Functional Unification Grammar’,Proceedings of the 5th Annual Meeting of the Berkeley Linguistics Association, Berkeley, California.
Lloyd, J. W.: 1984,Foundations of Logic Programming, Springer-Verlag, Berlin.
Manaster-Ramer, A. and W. Rounds: 1987, ‘A Logical Version of Functional Grammar’,Proceedings of the 25th Annual Meeting of the Association for Computational Linguistics, Stanford University, Palo Alto, California.
Nelson, G. and Oppen, D. C.: 1980, ‘Fast Decision Procedures Based on Congruence Closure’,J. ACM 27(2), 356–364.
Pereira, F.: 1982,Logic for Natural Language Analysis, Ph.D. thesis, The University of Edinburgh. Reprinted as Technical Note 275, Artificial Intelligence Center, SRI International, Menlo Park, California.
Pereira, F. and S. Shieber: 1984, ‘The Semantics of Grammar Formalisms seen as Computer Languages’,The Proceedings of COLINC 1984 Association for Computational Linguistics, Stanford University, Palo Alto, California.
Pereira, F. and S. Shieber: 1987,Prolog for Natural Language Analysis, CSLI Lecture Notes Series, University of Chicago Press.
Pereira, F. and D. H. D. Warren: 1983, ‘Parsing as Deduction’,Proceedings of the 21st Annual Meeting of the Association for Computational Linguistics, MIT, Cambridge, Massachusetts.
Pollard, C. and I. Sag: 1988,Head-Driven Phrase Structure Grammar, CSLI Lecture Notes Series, University of Chicago Press.
Rounds, W. C.: 1988, ‘LFP: A Logic for Linguistic Descriptions and an Analysis of its Complexity’,Computational Linguistics 14(4), 1–10.
Stabler, E.: 1992,The Logical Approach to Syntax: Foundations, Specifications and Implementations of Theories of Government and Binding. The MIT Press, Cambridge, Massachusetts.
Shieber, S.: 1986,An Introduction to Unification-Based Theories of Grammar, CSLI Lecture Notes Series, University of Chicago Press.
Shieber, S.: 1992,Constraint-Based Grammar Formalisms, The MIT Press, Cambridge, Massachusetts.
Smolka, G.: 1992, ‘Feature-Constraint Logics for Unification Grammars’,Journal of Logic Programming 12(1&2), 51–88.
Author information
Authors and Affiliations
Additional information
I would like to thank Edward Stabler and an anonymousL&P reviewer for their helpful comments on an earlier draft of this paper. Of course, all responsibility for errors in this paper rests with me.
Rights and permissions
About this article
Cite this article
Johnson, M. Two ways of formalizing grammars. Linguist Philos 17, 221–248 (1994). https://doi.org/10.1007/BF00985036
Issue Date:
DOI: https://doi.org/10.1007/BF00985036