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.

Categories

Keywords

Reprint years

2004

DOI

10.1023/a:1017916706972

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,516

External links

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

Through your library

My notes

Similar books and articles

Automated reasoning in normative detachment structures with ideal conditions.Tomer Libal & Matteo Pascucci - 2019 - In Tomer Libal & Matteo Pascucci (eds.), ICAIL: International Conference on Artificial Intelligence and Law. ACM. pp. 63-72.
Automated reasoning in higher-order logic using the tptp thf infrastructure.Sutcliffe Geoff & Benzmüller Christoph - 2010 - Journal of Formalized Reasoning 3 (1):1-27.
Natural Language Inference in Coq.Stergios Chatzikyriakidis & Zhaohui Luo - 2014 - Journal of Logic, Language and Information 23 (4):441-480.
Automating Leibniz's Theory of Concepts.Jesse Alama, Paul Edward Oppenheimer & Edward Zalta - 2015 - In Felty Amy P. & Middeldorp Aart (eds.), Automated Deduction – CADE 25: Proceedings of the 25th International Conference on Automated Deduction (Lecture Notes in Artificial Intelligence: Volume 9195), Berlin: Springer. Springer. pp. 73-97.
Automating Leibniz's Theory of Concepts.Paul Edward Oppenheimer, Jesse Alama & Edward N. Zalta - 2015 - In Felty Amy P. & Middeldorp Aart (eds.), Automated Deduction – CADE 25: Proceedings of the 25th International Conference on Automated Deduction (Lecture Notes in Artificial Intelligence: Volume 9195), Berlin: Springer. Springer. pp. 73-97.
Towards context-based disambiguation of mathematical expressions.Magdalena Wolska - unknown
The Higher-Order Prover LEO-II.Christoph Benzmüller, Nik Sultana, Lawrence C. Paulson & Frank Theiß - 2015 - Journal of Automated Reasoning 55 (4):389-404.
Representing and Reasoning about Game Strategies.Dongmo Zhang & Michael Thielscher - 2015 - Journal of Philosophical Logic 44 (2):203-236.
Converse-PDL with regular inclusion axioms: a framework for MAS logics.Barbara Dunin-Kęplicz, Linh Anh Nguyen & Andrzej Szalas - 2011 - Journal of Applied Non-Classical Logics 21 (1):61-91.
Defeasible Reasoning + Partial Models: A Formal Framework for the Methodology of Research Programs. [REVIEW]Fernando Tohmé, Claudio Delrieux & Otávio Bueno - 2011 - Foundations of Science 16 (1):47-65.

Analytics

Added to PP
2009-01-28

Downloads
31 (#721,523)

6 months
8 (#560,939)

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. Paul Grice - 1975 - In Donald Davidson (ed.), The logic of grammar. Encino, Calif.: Dickenson Pub. Co.. 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.
Circumscription — A Form of Non-Monotonic Reasoning.John McCarthy - 1980 - Artificial Intelligence 13 (1-2):27–39.

View all 14 references / Add more references