scispace - formally typeset
Open AccessJournal ArticleDOI

Interpretation as abduction

Jerry R. Hobbs, +3 more
- 01 Oct 1993 - 
- Vol. 63, Iss: 1, pp 69-142
Reads0
Chats0
TLDR
In this article, the TACITUS project at SRI developed an approach to abductive inference, called "weighted abduction" that has resulted in a significant simplification of how the problem of interpreting texts is conceptualized.
About: 
This article is published in Artificial Intelligence.The article was published on 1993-10-01 and is currently open access. It has received 856 citations till now. The article focuses on the topics: Pragmatics & Abductive reasoning.

read more

Citations
More filters
Book ChapterDOI

Designing High Order Recurrent Networks for Bayesian Belief Revision

Ashraf M. Abdelbar

External propagators in wasp: Preliminary report

Carmine Dodaro, +2 more
TL;DR: This paper reports on an extension of the ASP solver WASP that allows to provide new propagators externally, i.e. no modifications of the solver are needed, on a recent application of ASP to abduction in Natural Language Understanding, where plain ASP solvers are not effective.

Towards More Flexible and Common-Sensical Reasoning about Beliefs

Gees C. Stein, +1 more
TL;DR: In this paper, the authors present two systems that use case-based reasoning to reason about beliefs, called CaseMent and ATI'-Meta, to deal with incomplete, inaccurate or uncertain beliefs, when to ascribe beliefs and how to make reasoning about beliefs more common-sensical.
Book ChapterDOI

Are manipulative texts ‘coherent’?: Manipulation, presuppositions and (in-)congruity

Andrea Rocci
Journal ArticleDOI

High performance logic form transformation

Vasile Rus, +1 more
- 01 Sep 2002 - 
TL;DR: Extensions to a previously developed logic form representation and a method for transforming WordNet glosses into logic forms using a set of high-precision rules combined with aSet of high recall heuristics are presented.
References
More filters
Book

Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference

Judea Pearl
TL;DR: Probabilistic Reasoning in Intelligent Systems as mentioned in this paper is a complete and accessible account of the theoretical foundations and computational methods that underlie plausible reasoning under uncertainty, and provides a coherent explication of probability as a language for reasoning with partial belief.
Book ChapterDOI

Logic and conversation

H. P. Grice
- 12 Dec 1975 - 
Book

Relevance: Communication and Cognition

Dan Sperber, +1 more
TL;DR: In this paper, the authors present a list of symbols for verb-verb communication in the context of Verbal Communication, including the following: preface to second edition, preface and postface to first edition.
Book

Understanding Natural Language

Terry Winograd
TL;DR: A computer system for understanding English that contains a parser, a recognition grammar of English, programs for semantic analysis, and a general problem solving system based on the belief that in modeling language understanding, it must deal in an integrated way with all of the aspects of language—syntax, semantics, and inference.
Book ChapterDOI

The Proper Treatment of Quantification in Ordinary English

Richard Montague
TL;DR: The aim of this paper is to present in a rigorous way the syntax and semantics of a certain fragment of acertain dialect of English.
Frequently Asked Questions (6)
Q1. What are the contributions in this paper?

An approach to abductive inference developed in the TACITUS project has resulted in a dramatic simplification of how the problem of interpreting texts is conceptualized. It also suggests an elegant and thorough integration of syntax, semantics, and pragmatics. 

The relations r e / a n d nn are treated here as predicate variables, but they could be treated as predicate constants, in which case the authors would not have quantified over them. 

Implementations of different orders of interpretation, or different sorts of interaction among syntax, compositional semantics, and local pragmatics, can then be seen as different orders of search for a proof of s(O, n, e). 

In addition to type checking, the authors have introduced two other tevhnlques that are necessary for controlling the exploslon~unwinding recursive axioms and making use of syntactic noncoreference information. 

Syntax is captured in predicates like np, vp, and s. Compositional semantics is encoded in, for example, the way the predicat e p' is applied to its arguments in the first axiom, and in the lambda expression in the third argument of vp in the third axiom. 

The syntax portion is represented in standard Prolog manner, with nonterminals treated as predicates and having as two of its arguments the beginning and end points of the phrase spanned by the nonterminal.