Abstract
The paper introduces a technique for representing quantifier relations that can have different scope order depending on context and agents. The technique is demonstrated by classes of terms denoting relations, where each of the arguments of a relation term is bound by a different quantifier. We represent a formalization of linking quantifiers with the corresponding argument slots that they bind, across \(\lambda \)-abstractions. The purpose of the technique is to represent underspecified order of quantification, for computationally efficient and adequate representation of scope ambiguity in the absence of context and corresponding information about the order. Furthermore, the technique is used to represent subclasses of larger classes of relations depending on order of quantification or specific relations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bender, E.: Deep Linguistic Processing with HPSG (DELPH-IN). http://moin.delph-in.net
Copestake, A., Flickinger, D., Pollard, C., Sag, I.: Minimal recursion semantics: an introduction. Research on Language and Computation 3, 281–332 (2005)
Csli linguistic grammars online (lingo) lab at stanford university. http://lingo.stanford.edu
Gallin, D.: Intensional and Higher-Order Modal Logic. North-Holland (1975)
Hobbs, J.R., Shieber, S.M.: An algorithm for generating quantifier scopings. Computational Linguistics 13(1–2), 47–63 (1987)
Loukanova, R.: \(\gamma \)-Reduction in Type Theory of Acyclic Recursion (to appear)
Loukanova, R.: Generalized quantification in situation semantics. In: Gelbukh, A. (ed.) Computational Linguistics and Intelligent Text Processing. Lecture Notes in Computer Science, vol. 2276, pp. 46–57. Springer, Heidelberg (2002)
Loukanova, R.: Syntax-semantics interface for lexical inflection with the language of acyclic recursion. In: Bel-Enguix, G., Dahl, V., Jiménez-López, M.D. (eds.) Biology, Computation and Linguistics – New Interdisciplinary Paradigms, Frontiers in Artificial Intelligence and Applications, vol. 228, pp. 215–236. IOS Press, Amsterdam, Berlin, Tokyo, Washington, DC (2011)
Loukanova, R.: Semantic information with type theory of acyclic recursion. In: Huang, R., Ghorbani, A.A., Pasi, G., Yamaguchi, T., Yen, N.Y., Jin, B. (eds.) Proceedings of the 8th International Conference on Active Media Technology, AMT 2012, Macau, China, December 4-7, 2012. Lecture Notes in Computer Science, vol. 7669, pp. 387–398. Springer (2012)
Loukanova, R.: Algorithmic granularity with constraints. In: Imamura, K., Usui, S., Shirao, T., Kasamatsu, T., Schwabe, L., Zhong, N. (eds.) Brain and Health Informatics. Lecture Notes in Computer Science, vol. 8211, pp. 399–408. Springer International Publishing (2013)
Loukanova, R., Jiménez-López, M.D.: On the syntax-semantics interface of argument marking prepositional phrases. In: Pérez, J.B., Sánchez, M.A., Mathieu, P., RodrÃguez, J.M.C., Adam, E., Ortega, A., Moreno, M.N., Navarro, E., Hirsch, B., Lopes-Cardoso, H., Julián, V. (eds.) Highlights on Practical Applications of Agents and Multi-Agent Systems. Advances in Intelligent and Soft Computing, vol. 156, pp. 53–60. Springer, Heidelberg (2012)
Moschovakis, Y.N.: The formal language of recursion. The Journal of Symbolic Logic 54(04), 1216–1252 (1989)
Moschovakis, Y.N.: The logic of functional recursion. In: Logic and Scientific Methods, pp. 179–207. Kluwer Academic Publishers. Springer (1997)
Moschovakis, Y.N.: A logical calculus of meaning and synonymy. Linguistics and Philosophy 29, 27–89 (2006)
Thomason, R.H. (ed.): Formal Philosophy: Selected Papers of Richard Montague. Yale University Press, New Haven (1974)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Loukanova, R. (2016). Underspecified Quantification by the Theory of Acyclic Recursion. In: de la Prieta, F., et al. Trends in Practical Applications of Scalable Multi-Agent Systems, the PAAMS Collection. PAAMS 2016. Advances in Intelligent Systems and Computing, vol 473. Springer, Cham. https://doi.org/10.1007/978-3-319-40159-1_20
Download citation
DOI: https://doi.org/10.1007/978-3-319-40159-1_20
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-40158-4
Online ISBN: 978-3-319-40159-1
eBook Packages: EngineeringEngineering (R0)