Skip to main content

Inference and Computational Semantics

  • Chapter

Part of the book series: Studies in Linguistics and Philosophy ((SLAP,volume 77))

Abstract

In this paper we discuss inference in computational semantics. In particular, we argue that state-of-the-art methods in first-order theorem proving and model generation are of direct relevance to inference for natural language processing. This claim is based on our experience of implementing van der Sandt’s approach to presupposition, and much of the paper discusses this application. Incidentally, the reader can experiment with this implementation over the internet: most of what is discussed below is available as part of Johan Bos’s DORIS system (Discourse Oriented Representation and Inference System1).

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

Buying options

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 EPUB and 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
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Allen, J. (1995) Natural Language Understanding. Amsterdam: Benjamin/Cummings, 2nd edition.

    Google Scholar 

  • Andréka, H., I. Németi, and J. Van Benthem: (1998) Modal Languages and Bounded Fragments of Predicate Logic. Journal of Philosophical Logic 27(3), 217–274.

    Article  Google Scholar 

  • Baumgartner, P. (2000) FDPLL — A First-Order Davis-Putnam-Logeman-Loveland Procedure. In: D. McAllester (ed.): CADE-17-The 17th International Conference on Automated Deduction. Berlin: Springer Verlag. To appear.

    Google Scholar 

  • Bibel, W. and P. Schmitt (eds.) (1998) Automated Deduction — A Basis for Applications. Dordrecht: Kluwer.

    Google Scholar 

  • Blackburn, P. and J. Bos: (2000a) Representation and Inference for Natural Language. A First Course in Computational Semantics. Draft available at www.cornsem.org.

  • Blackburn, P. and J. Bos: (2000b) Working with Discourse Representation Theory. An Advanced Course in Computational Semantics. Draft available at www.comsem.org.

  • Blackburn, P., J. Bos, M. Kohlhase, and H. de Nivelle (1998) Automated Theorem Proving for Natural Language Understanding. Paper available at URL: http://www.uni-koblenz.de/~peter/cade-15-ws/.

  • De Nivelle, H. (1998) A Resolution Decision Procedure for the Guarded Fragment. In: CADE 15. Berlin: Springer Verlag.

    Google Scholar 

  • Franke, A. and M. Kohlhase (1999) System Description: Math Web, an Agent-Based Communication Layer for Distributed Automated Theorem Proving. In: 16th International Conference on Automated Deduction CADE-16.

    Google Scholar 

  • Kamp, H. and U. Reyle (1993) From Discourse to Logic. Dordrecht: Kluwer.

    Book  Google Scholar 

  • Kohlhase, M. (2000) Model Generation for Discourse Representation Theory. In: W. Horn (ed.): Proceedings of the 14th European Conference on Artifical Intelligence, Amsterdam: IOS Press, 441–445.

    Google Scholar 

  • McCune, W. (1998) Automatic Proofs and Counterexamples for Some Ortholattice Id entities. Information Processing Letters 65, 285–291.

    Article  Google Scholar 

  • Monz, C. and M. de Rijke (1998) A Resolution Calculus for Dynamic Semantics. In: Proceedings of the 6th Eurpopean Workshop on Logics in AI (JELIA′98). Berlin: Springer Verlag.

    Google Scholar 

  • Muskens, R. (1996) Combining Montague Semantics and Discourse Representation. Linguistics and Philosophy 19, 143–186.

    Article  Google Scholar 

  • Reyle, U. and D. M. Gabbay (1994) Direct Deductive computation on Discourse Representation Structures. Linguistics & Philosophy 17, 343–390.

    Article  Google Scholar 

  • Sutcliffe, G. and C. Suttner (1997) The results of the CADE-13 ATP system Competition. Journal of Automated Reasoning 18(2), 259–264. Special Issue on the CADE-13 Automated Theorem Proving System Competition.

    Article  Google Scholar 

  • Van der Sandt, R. A. (1992) Presupposition Projection as Anaphora Resolution. Journal of Semantics 9, 333–377.

    Article  Google Scholar 

  • Van Eijck, J. and F.-J. De Vries (1992) Dynamic Interpretation and Hoare Deduction. Journal of Logic, Language and Information 1(1), 1–44.

    Article  Google Scholar 

  • Weidenbach, C., B. Gaede, and G. Rock (1996) SPASS & FLOTTER, Version 0.42. In: M. McRobbie and J. Slaney (eds.): Proceedings of the 13th Conference on Automated Deduction. New Brunswick, NJ, USA. Berlin: Springer Verlag.

    Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Blackburn, P., Bos, J., Kohlhase, M., De Nivelle, H. (2001). Inference and Computational Semantics. In: Bunt, H., Muskens, R., Thijsse, E. (eds) Computing Meaning. Studies in Linguistics and Philosophy, vol 77. Springer, Dordrecht. https://doi.org/10.1007/978-94-010-0572-2_2

Download citation

  • DOI: https://doi.org/10.1007/978-94-010-0572-2_2

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-1-4020-0451-3

  • Online ISBN: 978-94-010-0572-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics