scispace - formally typeset
Open AccessJournal ArticleDOI

Interpretation as abduction

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
DissertationDOI

A logic-based approach to multimedia interpretation

Atila Kaya
TL;DR: This work presents a novel approach for the automatic generation of rich semantic metadata based on surface-level information, formalizing a multimedia interpretation algorithm that exploits formal inference services offered by a state-of-the-art reasoning engine.
Proceedings ArticleDOI

Question-Answering Based on Virtually Integrated Lexical Knowledge Base

TL;DR: An algorithm for causality inference based on a set of lexical knowledge bases that contain information about such items as event role, is-a hierarchy, relevant relation, antonymy, and other features is proposed.
Book ChapterDOI

Open Theories and Abduction for Context and Accommodation

TL;DR: A model is proposed for the representation of context by means of open logic theories parameterized by metavariables covered by constraints, formalized and implemented using constraint logic and metalogic programming notions.

Analyse thématique du discours : segmentation, structuration, description et représentation

TL;DR: In this article, a scheme d'annotation generique multi-annotation fonde sur la technologie XLink is presented, which nous sert de support de description des donnees.
Journal ArticleDOI

A weighted causal theory for acquiring and utilizing open knowledge

TL;DR: The work aims to provide a formal basis for acquiring and utilizing open knowledge by adding weights to hypothetical causal rules and using them to compare competing explanations which induce causal models satisfying the task.
References
More filters
Book

Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference

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

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

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

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.