Skip to main content

Deductions with Meaning

  • Conference paper
  • First Online:
Logical Aspects of Computational Linguistics (LACL 1998)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2014))

Abstract

In this paper, we consider some of the problems that arise if automated reasoning methods are applied to natural language semantics. It turns that out that the problem of ambiguity has a strong impact on the feasibility of any theorem prover for computational semantics. We briefly investigate the different aspects of ambiguity and review some of the solutions that have been proposed to tackle this problem.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Abney, S. Tagging and partial parsing. In Corpus-Based Methods in Language and Speech. Kluwer Academic Publishers, 1996.

    Google Scholar 

  2. Apt, K. R., J. Brunekreef, V. Partington, and A. Schaerf. Alma-0: An imperative language that supports declarative programming. ACM Toplas, 1998. In press.

    Google Scholar 

  3. Alshawi, H., editor. The Core Language Engine. MIT Press, Cambridge, Massachusetts, 1992.

    Google Scholar 

  4. Attardi, G., and M. Simi. Building proofs in context. In Proc. of Meta’ 94, LNCS 883, pages 410–424. Springer, 1994.

    Google Scholar 

  5. Attardi, G., and M. Simi. Proofs in context. In Doyle, J. and P. Torasso, editors, Principles of Knowledge Representation and Reasoning: Proc. of the Fourth International Conference. Morgan Kaufmann, 1994.

    Google Scholar 

  6. Benthem, J. van, and A. ter Meulen, editors. Handbook of Logic and Language. North-Holland, 1997.

    Google Scholar 

  7. Blackburn, P., and J. Bos. Representation and Inference for Natural Language. Available from http://www.coli.uni-sb.de/∼bos/comsem/, 1998.

  8. Booch, G. Object-Oriented Design. Benjamin/Cummings, 1991.

    Google Scholar 

  9. Bos, J. Predicate logic unplugged. In Dekker, P., and M. Stokhof, editors, Proceedings of the 10th Amsterdam Colloquium, pages 133–142. ILLC, University of Amsterdam, 1996.

    Google Scholar 

  10. Baader, F., and K. Schulz, editors. Frontiers of Combining Systems, Applied Logic Series. Kluwer Academic Publishers, 1996.

    Google Scholar 

  11. Crouch, D., C. Fox, J. van Genabith, and S. Glasbey, editors. The FraCaS Book. Unpublished manuscript, 1998.

    Google Scholar 

  12. Deemter, K. van. Towards a logic of ambiguous expressions. In van Deemter and Peters[13].

    Google Scholar 

  13. Deemter, K. van, and S. Peters, editors. Semantic Ambiguity and Underspecification. CSLI Publications, 1996.

    Google Scholar 

  14. Dörre, J. Efficient construction of underspecified semantics under massive ambiguity. In Proc. of the 35th Annual Meeting of the ACL, 1997.

    Google Scholar 

  15. Eijck, J. van. Axiomatizing dynamic logics for anaphora, 1998. CWI, Amsterdam.

    Google Scholar 

  16. Eijck, J. van. Programming with dynamic logic. Manuscript, CWI, Amsterdam, 1998.

    Google Scholar 

  17. Eijck, J. van, and J. Jaspars. Ambiguity and reasoning. Technical Report CS-R9616, CWI, Amsterdam, 1996.

    Google Scholar 

  18. Franconi, E. A treatment of plurals and plural quantifications based on a theory of collections. Minds and Machines, 3(4):453–474, 1993.

    Article  Google Scholar 

  19. Groenendijk, J., and M. Stokhof. Dynamic Predicate Logic. Linguistics and Philosophy, 14:39–100, 1991.

    Article  MATH  Google Scholar 

  20. Jaspars, J. Minimal logics for reasoning with ambiguous expressions. CLAUS-report 94, Universität des Saarlandes, 1997.

    Google Scholar 

  21. Kamp, H., and U. Reyle. A calculus for first order Discourse Representation Structures. Journal of Logic, Language and Information, 5:297–348, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  22. Küssner, U. Description logic unplugged. In Franconi, E., et al., itors, Proceedings of the 1998 International Description Logics Workshop (DL’98), 1998.

    Google Scholar 

  23. Loveland, D. W. Automated Theorem Proving: A Logical Bases. North-Holland, Amsterdam, 1978.

    Google Scholar 

  24. McAllester, D. A., and R. Givan. Natural language syntax and first-order inference. Artificial Intelligence, 56(1):1–20, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  25. McCarthy, J., and S. Buvač. Formalizing context (expanded notes). In Aliseda, A., R. van Glabbeek, and D. Westerståhl, editors, Computing Natural Language, pages 13–50. Stanford University, 1997.

    Google Scholar 

  26. Montague, R. The proper treatment of quantification in ordinary english. In Hintikka, J., J. Moravcsik, and P. Suppes, editors, Approaches to Natural Language. Proceedings of the 1970 Stanford Workshop on Grammar and Semantics. Reidel, Dordrecht, 1973.

    Google Scholar 

  27. Monz, C., and M. de Rijke. Labeled resolution for discourse semantics. In Proc. LD’98. Dept. of Computer Science, Univ. of Freiburg, 1998.

    Google Scholar 

  28. Monz, C., and M. de Rijke. A resolution calculus for dynamic semantics. In Dix, J., et al., editors, Proc. JELIA’98, LNAI 1489, pages 184–198. Springer, 1998.

    Google Scholar 

  29. Monz, C., and M. de Rijke. A tableaux calculus for ambiguous quantification. In Swart, H. de, editor, Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX’98, LNAI 1397, pages 232–246. Springer, 1998.

    Google Scholar 

  30. Monz, C., and M. de Rijke. A tableau calculus for pronoun resolution. In Murray, N. V., editor, Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX’99, LNAI. Springer, 1999.

    Google Scholar 

  31. Monz, C. Computing presuppositions by contextual reasoning. In Proceedings of the AAAI-99 Workshop on Reasoning in Context for AI Applications, 1999.

    Google Scholar 

  32. Monz, C. Contextual inference in computational semantics. Submitted for publication, 1999.

    Google Scholar 

  33. Monz, C. Underspecified theorem proving with different kinds of ambiguity. Institute for Computational Linguistics, University of Stuttgart, 1999.

    Google Scholar 

  34. Patel-Schneider, P. DLP system description. In Franconi, E., et al., editor, Proceedings of the 1998 International Description Logics Workshop (DL’98), pages 87–89, 1998.

    Google Scholar 

  35. Reyle, U. Dealing with ambiguities by underspecification: Construction, representation, and deduction. Journal of Semantics, 10(2):123–179, 1993.

    Article  Google Scholar 

  36. Reyle, U. On reasoning with ambiguities. In Proceedings of the 6th Meeting of the EACL, pages 1–8, Dublin, 1995.

    Google Scholar 

  37. Reyle, U., and D. Gabbay. Direct deductive computation on Discourse Representation Structures. Linguistics and Philosophy, 17(4):343–390, 1994.

    Article  MATH  Google Scholar 

  38. Rijsbergen, K. van. A non-classical logic for information retrieval. The Computer Journal, 29:481–485, 1986.

    Article  MATH  Google Scholar 

  39. Robinson, J. A. A machine oriented logic based on the resolution principle. Journal of the ACM, 12(1):23–41, 1965.

    Article  MATH  Google Scholar 

  40. Saurer, W. A natural deduction system for Discourse Representation Theory. Journal of Philosophical Logic, 22:249–302, 1990.

    Article  MathSciNet  Google Scholar 

  41. Schiehlen, M. Semantic construction from parse forests. In Proc. COLING’96, 1996.

    Google Scholar 

  42. Sedogbo, C., and M. Eytan. A tableau calculus for DRT. Logique et Analyse, 31:379–402, 1986.

    MathSciNet  Google Scholar 

  43. Veltman, F. Dynamic predicate logic, 1997. ILLC, Amsterdam.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Monz, C., de Rijke, M. (2001). Deductions with Meaning. In: Moortgat, M. (eds) Logical Aspects of Computational Linguistics. LACL 1998. Lecture Notes in Computer Science(), vol 2014. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45738-0_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-45738-0_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42251-8

  • Online ISBN: 978-3-540-45738-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics