Skip to main content
SpringerLink
Log in

Specification of Underspecified Quantifiers via Question-Answering by the Theory of Acyclic Recursion

  • Conference paper
  • First Online:
Flexible Query Answering Systems 2015

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 400))

Abstract

This paper introduces a technique for specifying quantifier scope distribution in formal terms that represent underspecified quantifier scopes. For this purpose, we extend the higher-order theory of acyclic recursion, by adding generalized quantifiers and terms for multiple quantifiers with underspecified scope. The specification of the quantifier scopes is by using interactive questions and answers that are also rendered into formal terms of the theory of acyclic recursion.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Gallin, D.: Intensional and Higher-Order Modal Logic. North-Holland (1975)

    Google Scholar 

  2. Lindström, P.: First order predicate logic with generalized quantifiers. Theoria 32(3), 186–195 (1966)

    MathSciNet  MATH  Google Scholar 

  3. Loukanova, R.: \(\gamma \)-Reduction in Type Theory of Acyclic Recursion (to appear)

    Google Scholar 

  4. Loukanova, R.: Introduction to the Type Theory of Acyclic Recursion with Underspecified Types (to appear)

    Google Scholar 

  5. Loukanova, R.: Algorithmic granularity with constraints. In: Imamura, K., Usui, S., Shirao, T., Kasamatsu, T., Schwabe, L., Zhong, N. (eds.) BHI 2013. LNCS, vol. 8211, pp. 399–408. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  6. Moschovakis, Y.N.: Sense and denotation as algorithm and value. In: Oikkonen, J., Vaananen, J. (eds.) Lecture Notes in Logic. Lecture Notes in Logic, No. 2, pp. 210–249. Springer (1994)

    Google Scholar 

  7. Moschovakis, Y.N.: A logical calculus of meaning and synonymy. Linguistics and Philosophy 29, 27–89 (2006)

    Article  Google Scholar 

  8. Mostowski, A.: On a generalization of quantifiers. Fundamenta Mathematicae 1(44), 12–36 (1957)

    MathSciNet  Google Scholar 

  9. Thomason, R.H. (ed.): Formal Philosophy: Selected Papers of Richard Montague. Yale University Press, New Haven (1974)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Stockholm University, Stockholm, Sweden

    Roussanka Loukanova

Authors
  1. Roussanka Loukanova
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Roussanka Loukanova .

Editor information

Editors and Affiliations

  1. Dept. of Comm., Business & Info. Tech., Roskilde University, Roskilde, Denmark

    Troels Andreasen

  2. Dept. Computer Science, Roskilde University, Roskilde, Denmark

    Henning Christiansen

  3. Sys Res Intit of Polish Acad of Science, Intelligent Systems Laboratory, Warsaw, Poland

    Janusz Kacprzyk

  4. Department of Electronic Systems, Aalborg University, Esbjerg, Denmark

    Henrik Larsen

  5. Computer Science Department, University Milano-Biccoca, Milano, Italy

    Gabriella Pasi

  6. IRISA, University of Rennes I, Rennes, France

    Olivier Pivert

  7. Dept. of Tele. & Info. Processing, Ghent University, Gent, Belgium

    Guy De Tré

  8. Dept. of Comp. & Art. Int. Sci., University of Granada, Granada, Spain

    Maria Amparo Vila

  9. Department of Computer Engineering, Middle East Technical University, Ankara, Turkey

    Adnan Yazici

  10. Systems Research Institute, Polish Academy of Sciences, Warsaw, Poland

    Sławomir Zadrożny

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Loukanova, R. (2016). Specification of Underspecified Quantifiers via Question-Answering by the Theory of Acyclic Recursion. In: Andreasen, T., et al. Flexible Query Answering Systems 2015. Advances in Intelligent Systems and Computing, vol 400. Springer, Cham. https://doi.org/10.1007/978-3-319-26154-6_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-26154-6_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-26153-9

  • Online ISBN: 978-3-319-26154-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation