Skip to main content
SpringerLink
Log in
Book cover

European Workshop on Logics in Artificial Intelligence

JELIA 1998: Logics in Artificial Intelligence pp 184–198Cite as

A Resolution Calculus for Dynamic Semantics

  • Conference paper
  • First Online:

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

Abstract

This paper applies resolution theorem proving to natural language semantics. The aim is to circumvent the computational complexity triggered by natural language ambiguities like pronoun binding, by interleaving pronoun binding with resolution deduction. To this end, disambiguation is only applied to expressions that actually occur during derivations. Given a set of premises and a conclusion, our resolution method only delivers pronoun bindings that are needed to derive the conclusion.

This is a preview of subscription content, 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   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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. B. Grosz, A. Joshi, and S. Weinstein. Centering: A framework for modelling the local coherence of discourse. Computational Linguistics, 21(2), 1995.

    Google Scholar 

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

    Article  MATH  Google Scholar 

  3. H. Kamp. A theory of truth and semantic representation. In J. Groenendijk et al., editor, Formal Methods in the Study of Language. Mathematical Centre, Amsterdam, 1981.

    Google Scholar 

  4. M. Kohlhase and K. Konrad. Higher-order automated theorem proving for natural language semantics. SEKI-Report SR-98-04, Universität des Saarlandes, 1998.

    Google Scholar 

  5. M. Kohlhase. Higher-order tableaux. In P. Baumgartner et al., editor, Theorem Proving with Analytic Tableaux and Related Methods, TABLEAUX’95, LNAI, pages 294–309. Springer, 1995.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  8. A. Martelli and U. Montanari. An efficient unification algorithm. ACM Transactions on Programming Languages and Systems, 4:258–282, 1982.

    Article  MATH  Google Scholar 

  9. C. Monz. Dynamic semantics and underspecification. In H. Prade, editor, Proceedings of the 13 th European Conference on Artificial Intelligence. (ECAI’98), pages 201–202. John Wiley & Sons, 1998.

    Google Scholar 

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

    Article  Google Scholar 

  11. S.J. Russell and P. Norvig. Artificial Intelligence: A Modern Approach. Prentice Hall, 1995.

    Google Scholar 

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

    Article  MATH  Google Scholar 

  13. J. van Eijck. A calculus for dynamic predicate logic. Unpublished manuscript, 1998.

    Google Scholar 

  14. J. van Eijck and J. Jaspars. Ambiguity and reasoning. Technical Report CS-R9616, Centrum voor Wiskunde en Informatica, Amsterdam, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ILLC, University of Amsterdam, Plantage Muidergracht 24, 1018 TV, Amsterdam, The Netherlands

    Christof Monz & Maarten de Rijke

Authors
  1. Christof Monz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maarten de Rijke
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Maryland, College Park, Maryland, 20742, USA

    Jürgen Dix

  2. I.R.I.T. Université Paul Sabatier, 118 route de Narbonne, F-31062, Toulouse Cedex, France

    Luís Fariñas del Cerro

  3. Fachbereich 4: Informatik, Universität Koblenz, Rheinau 1, D-56075, Koblenz, Germany

    Ulrich Furbach

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Monz, C., de Rijke, M. (1998). A Resolution Calculus for Dynamic Semantics. In: Dix, J., del Cerro, L.F., Furbach, U. (eds) Logics in Artificial Intelligence. JELIA 1998. Lecture Notes in Computer Science(), vol 1489. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49545-2_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-49545-2_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65141-3

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation