Towards the use of automated reasoning in discourse disambiguation

Journal of Logic, Language and Information 10 (4):487-509 (2001)
  Copy   BIBTEX

Abstract

In this paper, we claim that the disambiguation ofreferring expressions in discourse can be formulated in terms automatedreasoners can address. Specifically, we show that consistency,informativity and minimality are criteria which (i) can be implementedusing automated reasoning tools and (ii) can be used to disambiguatenoun-noun compounds, metonymy and definite descriptions.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,440

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
21 (#743,126)

6 months
4 (#799,214)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Computational semantics.Patrick Blackburn & Johan Bos - 2003 - Theoria 18 (1):27-45.
Computational Semantics.Patrick Blackburn & Johan Bos - 2010 - Theoria 18 (1):27-45.

Add more citations

References found in this work

Logic and Conversation.H. P. Grice - 1975 - In Donald Davidson & Gilbert Harman (eds.), The Logic of Grammar. Encino, CA: pp. 64-75.
Scorekeeping in a language game.David Lewis - 1979 - Journal of Philosophical Logic 8 (1):339--359.
On referring.Peter F. Strawson - 1950 - Mind 59 (235):320-344.
Scorekeeping in a Language Game.David Lewis - 1979 - Journal of Philosophical Logic 8 (3):339.
Circumscription — A Form of Non-Monotonic Reasoning.John McCarthy - 1980 - Artificial Intelligence 13 (1-2):27–39.

View all 15 references / Add more references