Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
2017 | Vol. 5, No. 2 | 357--383
Tytuł artykułu

Quantification in frame semantics with binders and nominals of hybrid logic

Treść / Zawartość
Warianty tytułu
Języki publikacji
This paper aims to integrate logical operators into frame-based semantics. Frames are semantic graphs that allow lexical meaning to be captured in a fine-grained way but that do not come with a natural way to integrate logical operators such as quantifiers. The approach we propose stems from the observation that modal logic is a powerful tool for describing relational structures, including frames. We use its hybrid logic extension in order to incorporate quantification and thereby allow for inference and reasoning. We integrate our approach into a type theoretic compositional semantics, formulated within Abstract Categorial Grammars. We also show how the key ingredients of hybrid logic, nominals and binders, can be used to model semantic coercion, such as the one induced by the begin predicate. In order to illustrate the effectiveness of the proposed syntax-semantics interface, all the examples can be run and tested with the Abstract Categorial Grammar development toolkit.

Opis fizyczny
Bibliogr. 42 poz., rys.
  • Heinrich Heine Universität, Düsseldorf, Germany
  • Heinrich Heine Universität, Düsseldorf, Germany
  • Heinrich Heine Universität, Düsseldorf, Germany
  • INRIA, Villers-lès-Nancy, France
  • Université de Lorraine, LORIA, Vandoeuvre-lès-Nancy, France
  • CNRS, LORIA, Vandoeuvre-lès-Nancy, France
  • [1] Carlos Areces, Patrick Blackburn, Antonia Huertas, and María Manzano (2011), Hybrid Type Theory: A Quartet in Four Movements, Principia, 15 (2): 225-247, doi: 10.5007/1808-1711.2011v15n2p225.
  • [2] Carlos Areces, Patrick Blackburn, Antonia Huertas, and María Manzano (2014), Completeness in Hybrid Type Theory, Journal of Philosophical Logic, 43 (2-3): 209-238, ISSN 0022-3611, doi: 10.1007/s10992-012-9260-4.
  • [3] Carlos Areces, Patrick Blackburn, and Maarten Marx (1999), A Road-Map on Complexity for Hybrid Logics, in Jörg Flum and Mario Rodriguez-Artalejo, editors, Computer Science Logic: 13th International Workshop, CSL’99 8th Annual Conference of the EACSL Madrid, Spain, September 20-25, 1999 Proceedings, pp. 307-321, Springer Berlin Heidelberg, doi: 10.1007/3-540-48168-0_22.
  • [4] Carlos Areces and Balder ten Cate (2007), Hybrid logics, in Patrick Blackburn, Johan Van Benthem, and Frank Wolter, editors, Handbook of Modal Logic, volume 3 of Studies in Logic and Practical Reasoning, chapter 14, pp. 821-868, Elsevier, doi: 10.1016/S1570-2464(07)80017-6.
  • [5] Jason Baldridge and Geert-Jan Kruijff (2002), Coupling CCG and Hybrid Logic Dependency Semantics, in Proceedings of 40th Annual Meeting of the Association for Computational Linguistics, pp. 319-326, Association for Computational Linguistics, Philadelphia, Pennsylvania, USA, doi: 10.3115/1073083.1073137, ACL anthology: P02-1041.
  • [6] Hendrik Pieter Barendregt (1984), The lambda calculus, volume 103 of Studies in Logic and the Foundations of Mathematics, North-Holland.
  • [7] Lawrence Barsalou (1992), Frames, concepts, and conceptual fields, in Adrienne Lehrer and Eva Feder Kittey, editors, Frames, fields, and contrasts: New essays in semantic and lexical organization, pp. 21-74, Lawrence Erlbaum Associates, Hillsdale.
  • [8] Patrick Blackburn (1993), Modal Logic and Attribute Value Structures, in Maarten de Rijke, editor, Diamonds and Defaults, volume 229 of Synthese Library, pp. 19-65, Springer Netherlands, ISBN 978-90-481-4286-6, doi: 10.1007/978-94-015-8242-1_2.
  • [9] Patrick Blackburn and Maarten Marx (2002), Tableaux for Quantified Hybrid Logic, in Uwe Egly and Chritian G. Fermüller, editors, Automated Reasoning with Analytic Tableaux and Related Methods: International Conference, TABLEAUX 2002 Copenhagen, Denmark, July 30 – August 1, 2002 Proceedings, pp. 38-52, Springer, Berlin, Heidelberg, doi: 10.1007/3-540-45616-3_4.
  • [10] Patrick Blackburn and Maarten De Rijke (1997), Zooming In, Zooming Out, Journal of Logic, Language and Information, 6 (1): 5-31, ISSN 0925-8531, doi: 10.1023/A%3A1008204403391.
  • [11] Patrick Blackburn and Jerry Seligman (1995), Hybrid languages, Journal of Logic, Language and Information, 4 (3): 251-272, doi: 10.1007/BF01049415.
  • [12] Johan Bos (1995), Predicate Logic Unplugged, in Proceedings of the Tenth Amsterdam Colloquium,
  • [13] Haskell Brooks Curry (1961), Some Logical Aspects of Grammatical Structure, in Roman Jakobson, editor, Structure of Language and its Mathematical Aspects: Proceedings of the Twelfth Symposium in Applied Mathematics, pp. 56-68, American Mathematical Society.
  • [14] Philippe de Groote (2001), Towards Abstract Categorial Grammars, in Association for Computational Linguistics, 39th Annual Meeting and 10th Conference of the European Chapter, Proceedings of the Conference, pp. 148-155, ACL anthology: P01-1033.
  • [15] Philippe de Groote (2002), Tree-Adjoining Grammars as Abstract Categorial Grammars, in Proceedings of the Sixth International Workshop on Tree Adjoining Grammars and Related Frameworks (TAG+6), pp. 145-150, Università di Venezia,
  • [16] Philippe de Groote (2006), Towards a Montagovian account of dynamics, in Masayuki Gibson and Jonathan Howell, editors, Proceedings of Semantics and Linguistic Theory (SALT) 16, doi: 10.3765/salt.v16i0.2952.
  • [17] Philippe de Groote and Sylvain Pogodalla (2004), On the expressive power of Abstract Categorial Grammars: Representing context-free formalisms, Journal of Logic, Language and Information, 13 (4): 421-438, doi: 10.1007/s10849-004-2114-x, hal open archive: inria-00112956.
  • [18] Charles J. Fillmore (1977), The case for case reopened, in Peter Cole and Jerrold M. Sadock, editors, Grammatical Relations, volume 8 of Syntax and Semantics, pp. 59-81, Academic Press, New York.
  • [19] Massimo Franceschet and Maarten de Rijke (2006), Model checking hybrid logics (with an application to semistructured data), Journal of Applied Logic, 4 (3): 279-304, doi: 10.1016/j.jal.2005.06.010.
  • [20] Daniel Gallin (1975), Intensional and Higher-Order Modal Logic, North-Holland.
  • [21] Thomas Gamerschlag, Doris Gerland, Rainer Osswald, and Wiebke Petersen, editors (2014), Frames and Concept Types, volume 94 of Studies in Linguistics and Philosophy, Springer International Publishing, doi: 10.1007/978-3-319-01541-5.
  • [22] Seohyun Im and Chunngmin Lee (2015), A Developed Analysis of Type Coercion Based on Type Theory and Conventionality, in Robin Cooper and Christian Retoré, editors, Type Theory and Lexical Semantics, ESSLLI 2015, Barcelona, Spain,
  • [23] Laura Kallmeyer and Rainer Osswald (2013), Syntax-Driven Semantic Frame Composition in Lexicalized Tree Adjoining Grammars, Journal of Language Modelling, 1 (2): 267-330, doi: 10.15398/jlm.v1i2.61.
  • [24] Laura Kallmeyer, Rainer Osswald, and Sylvain Pogodalla (2015), Progression and Iteration in Event Semantics - An LTAG Analysis Using Hybrid Logic and Frame Semantics, in Colloque de Syntaxe et Sémantique à Paris (CSSP 2015), hal open archive: hal-01184872.
  • [25] Laura Kallmeyer and Frank Richter (2014), Quantifiers in Frame Semantics, in Glyn Morrill, Reinhard Muskens, Rainer Osswald, and Frank Richter, editors, Formal Grammar, volume 8612 of Lecture Notes in Computer Science, pp. 69-85, Springer, doi: 10.1007/978-3-662-44121-3_5.
  • [26] Laura Kallmeyer and Maribel Romero (2008), Scope and Situation Binding for LTAG, Research on Language and Computation, 6 (1): 3-52, doi: 10.1007/s11168-008-9046-6.
  • [27] Joachim Lambek (1958), The Mathematics of Sentence Structure, American Mathematical Monthly, 65 (3): 154-170.
  • [28] Ekaterina Lebedeva (2012), Expression de la dynamique du discours à l’aide de continuations, Ph.D. thesis, Université de Lorraine, in English.
  • [29] Sebastian Löbner (2014a), Evidence for frames from human language, in Gamerschlag et al. (2014), chapter 2, pp. 23-67, doi: 10.1007/978-3-319-01541-5_2.
  • [30] Sebastian Löbner (2014b), Frames and metonymy – Shifting the center and refocusing the frame, Concept Types and Frames in Language, Cognition, and Science (CTF14), invited talk,
  • [31] Igor A. Mel’čuk, André Clas, and Alain Polguère (1995), Introduction à la lexicologie explicative et combinatoire, Éditions Duculot, Louvain-la-Neuve.
  • [32] Marc Moens and Mark Steedman (1988), Temporal Ontology and Temporal Reference, Computational Linguistics, 14 (2): 15-28, ACL anthology: J88-2003.
  • [33] Richard Montague (1974), The Proper Treatment of Quantification in Ordinary English, in Formal Philosophy: Selected Papers of Richard Montague, Yale University Press, re-edited in “Formal Semantics: The Essential Readings”, Paul Portner and Barbara H. Partee, editors. Blackwell Publishers, 2002.
  • [34] Reinhard Muskens (2013), Data Semantics and Linguistic Semantics, in Maria Aloni, Michael Franke, and Floris Roelofsen, editors, The dynamic, inquisitive, and visionary life of ϕ, ?ϕ, and ◊ ϕ, chapter 24, pp. 175-183,,
  • [35] Rainer Osswald and Robert D. Van Valin, Jr. (2014), FrameNet, Frame Structure, and the Syntax-Semantics Interface, in Gamerschlag et al. (2014), chapter 6, pp. 125-156, doi: 10.1007/978-3-319-01541-5_6.
  • [36] Wiebke Petersen (2007), Representation of Concepts as Frames, The Baltic International Yearbook of Cognition, Logic and Communication, 2: 151-170,
  • [37] Sylvain Pogodalla (2004), Computing Semantic Representation: Towards ACG Abstract Terms as Derivation Trees, in Seventh International Workshop on Tree Adjoining Grammar and Related Formalisms - TAG+7, pp. 64-71, Vancouver, BC, Canada, hal open archive: inria-00107768.
  • [38] Alain Polguère (2003), Lexicologie et sémantique lexicale, Les Presses de l’Université de Montréal.
  • [39] James Pustejovsky (1998), The Generative Lexicon, MIT Press.
  • [40] James Pustejovsky and Pierrette Bouillon (1995), Aspectual Coercion and Logical Polysemy, Journal of Semantics, 12 (2): 133-162, doi: 10.1093/jos/12.2.133.
  • [41] Thomas Schneider (2007), The Complexity of Hybrid Logics over Restricted Classes of Frames, Ph.D. thesis, University of Jena, Germany,
  • [42] Balder ten Cate and Massimo Franceschet (2005), On the Complexity of Hybrid Logics with Binders, in Luke Ong, editor, Computer Science Logic: 19th International Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005. Proceedings, pp. 339-354, Springer Berlin Heidelberg, doi: 10.1007/11538363_24.
Typ dokumentu
Identyfikator YADDA
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.