Abstract
This paper gives a simple method for providing categorial brands of feature-based unification grammars with a model-theoretic semantics. The key idea is to apply the paradigm of fibred semantics (or layered logics, see Gabbay (1990)) in order to combine the two components of a feature-based grammar logic. We demonstrate the method for the augmentation of Lambek categorial grammar with Kasper/Rounds-style feature logic. These are combined by replacing (or annotating) atomic formulas of the first logic, i.e. the basic syntactic types, by formulas of the second. Modelling such a combined logic is less trivial than one might expect. The direct application of the fibred semantics method where a combined atomic formula like np (num: sg & pers: 3rd) denotes those strings which have the indicated property and the categorial operators denote the usual left- and right-residuals of these string sets, does not match the intuitive, unification-based proof theory. Unification implements a global bookkeeping with respect to a proof whereas the direct fibring method restricts its view to the atoms of the grammar logic. The solution is to interpret the (embedded) feature terms as global feature constraints while maintaining the same kind of fibred structures. For this adjusted semantics, the anticipated proof system is sound and complete.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Blackburn, P., 1993, “Modal logic and attribute value structures,” in Diamonds and Defaults, M. de Rijke, ed., vol. 229 in Synthese Language Library, Dordrecht: Kluwer Academic Publishers, pp. 19–65.
Blackburn, P., 1994, “The structural approach to feature logic,” pp. 1–27 in Constraints, Language and Computation, C.J. Rupp, M.A. Rosner, and R.L. Johnson, eds., London: Academic Press.
Blackburn, P., Gardent, C., and Meyer-Viol, W., 1993, “Talking about trees,” pp. 21–29 in Proceedings of the 6th Conference of the European Chapter of the Association for Computational Linguistics, Utrecht, 1993.
Blackburn, P. and Meyer-Viol, W., 1994, “Linguistics, logic and finite trees,” Bulletin of the Interest Group in Pure and Applied Logics 2(1), 3–29.
Blackburn, P. and Spaan, E., 1993, “A modal perspective on the computational complexity of attribute value grammar,” Journal of Logic, Language and Information 2, 129–169.
Bouma, G., 1993, Nonmonotonicity and Categorial Unification Grammar. PhD Thesis, Rijksuniversiteit Groningen, Groningen, The Netherlands.
Buszkowski, W., 1982, “Compatibility of a categorial grammar with an associated category system,” Zeitschrift für mathematische Logik und Grundlagen der Mathematik 28, 229–237.
Buszkowski, W., 1986 “Completeness results for Lambek syntactic calculus,” Zeitschrift für mathematische Logik und Grundlagen der Mathematik 32, 13–28.
Dörre, J., 1993 Feature-Logik und Semiunifikation. Dissertation, Institut für maschinelle Sprachverarbeitung, Azenbergstr. 12, D-70174 Stuttgart, Germany. In German. Prepublished as Technical Report 48, Sonderforschungsbereich 340.
Dörre, J. and Dorna, M., 1993, CUF-a formalism for linguistic knowledge representation. Deliverable R.1.2A, DYANA 2.
Dörre, J. and Rounds, W.C., 1992, “On Subsumption and Semi-Unification in Feature Algebras,” Journal of Symbolic Computation 13, 441–461.
Došen, K., 1985, “A completeness theorem for the Lambek calculus of syntactic categories,” Zeitschrift für mathematische Logik und Grundlagen der Mathematik 31, 235–241.
Došen, K., 1992, “A brief survey of frames for the Lambek calculus,” Zeitschrift für mathematische Logik und Grundlagen der Mathematik 38, 179–187. Preprint: Konstanzer Berichte, Logik und Wissenschaftstheorie, May 1990.
Finger, M. and Gabbay, D.M., 1992 “Adding a temporal dimension to a logic system,” Journal of Logic, Language and Information 1(3), 203–233.
Gabbay, D.M., Labelled deductive systems, Vol. 1 (3rd intermediate draft). Technical Report MPI-I-94–223, Max-Planck-Institut, Saarbrücken, Germany, 1994. 1st draft Manuscript 1989; 2nd intermediate draft, CIS-Bericht 90–22, CIS, University of Munich, 1990; Oxford University Press, to appear.
Garey, M.R. and Johnson, D.S., 1979, Computers and Intractability — A Guide to the Theory of NP-Completeness, San Francisco, CA: Freeman.
Girard, J.-Y., 1987, “Linear logic,” Theoretical Computer Science 50, 1–102.
Höhfeld, M. and Smolka, G., 1988, Definite relations over constraint languages. LILOG-Report 53, IBM Deutschland, Stuttgart, Baden-Württemberg.
Hopcroft, J.E and Ullman, J.D., 1979, Introduction to Automata Theory, Languages, and Computation, Reading, MA: Addison-Wesley.
Kaplan, R.M. and Bresnan, J., 1982, “Lexical-Functional Grammar: A formal system for grammatical representation,” pp. 173–281 in The Mental Representation of Grammatical Relations, Joan Bresnan, ed., Cambridge, MA: MIT Press.
Kasper, R.T. and Rounds, W.C., 1986, “A logical semantics for feature structures,” pp. 257–265 in Proceedings of the 24th Annual Meeting of the ACL, Columbia University, New York, N.Y.
Kay, M., 1985, “Unification in grammar,” pp. 233–241 in Natural Language Understanding and Logic Programming, V. Dahl and P. Saint-Dizier, eds., Amsterdam: Elsevier Science Publishers (North Holland).
König, E., 1994 Lambek categorial grammars are context-free. Manuscript, Institut für Maschinelle Sprachverarbeitung, Universität Stuttgart.
König, E., 1994, A study in grammar design. Arbeitspapier 54 des Sonderforschungsbereich 340, Institut für Maschinelle Sprachverarbeitung, Universität Stuttgart.
Lambek, J., 1958, “The mathematics of sentence structure,” American Mathematical Monthly 65, 154–170. Reprinted in: Buszkowski, W., Marciszewski, W., and van Benthem, J. (eds.), 1988, Categorial Grammar, Amsterdam: John Benjamins.
Moortgat, M., 1992, “Generalized quantifiers and discontinuous type constructors,” in Proceedings of the Tilburg Symposium on Discontinuous Constituency, W. Sijtsma and A. van Horck, eds., The Hague: Mouton de Gruyter.
Morrill, G., 1994, Type Logical Grammar: Categorial Logic of Signs, Dordrecht: Kluwer Academic Publishers.
Pentus, M., 1994, “Language completeness of the Lambek calculus,” in Proceedings of Logic in Computer Science, Paris.
Pereira, F.C.N. and Shieber, S.M., 1984, “The semantics of grammar formalisms seen as computer languages,” pp. 123–129 in Proceedings. of the 22nd Annual Meeting of the Association for Computational Linguistics, Stanford, CA.
Pereira, F.C.N. and Warren, D.H.D., 1980, “Definite clause grammars for language analysis—A survey of the formalism and a comparison with augmented transition networks,” Artificial Intelligence 13, 231–278.
Prawitz, D., 1965, Natural Deduction, Uppsala: Alqvist and Wiksell.
Reyle, U., 1993, “Dealing with ambiguities by underspecification: Construction, representation, and deduction,” Journal of Semantics 10(2), 123–179.
Shieber, S., Uszkoreit, H., Pereira, F., Robinson, J., and Tyson, M., 1983, “The formalism and implementation of PATR-II,” in Research on Interactive Acquisition and Use of Knowledge, B. Grosz and M.E. Stickel, eds., Menlo Park, CA: Stanford Research Institute International.
Smolka, G., 1992, “Feature constraint logics for unification grammars,” The Journal of Logic Programming 12, 51–87.
Uszkoreit, H., 1986, “Categorical Unification Grammar,” pp. 187–194 in Proceedings of the 11th International Conference on Computational Linguistics, Bonn, Germany.
Versmissen, K., 1993, “Categorial grammar, modalities and algebraic semantics,” pp. 377–383 in Proceedings of the 6th Conference of the European Association of Computational Linguistics, Utrecht, The Netherlands.
Vijay-Shanker, K., 1992, “Using descriptions of trees in a Tree Adjoining Grammar,” Computational Linguistics 18(4), 481–517.
Yetter, D.N., 1990. “Quantales and (noncommutative) Linear Logic,” Journal of Symbolic Logic 55(1): 41–64.
Zeevat, H., Klein, E., and Calder, J., 1987, “An introduction to Unification Categorial Grammar,” pp. 195–222 in Categorial Grammar, Unification Grammar, and Parsing, N.J. Haddock, E. Klein, and G. Morrill, eds., Edinburgh Working Papers in Cognitive Science 1, Centre for Cognitive Science, University of Edinburgh.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Dörre, J., König, E. & Gabbay, D. Fibred semantics for feature-based grammar logic. J Logic Lang Inf 5, 387–422 (1996). https://doi.org/10.1007/BF00159345
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF00159345