Default reasoning as likelihood reasoning

Published 22 August 1983

Elaine Rich

Citations32

TL;DR

The goal of this paper is to show that if default reasoning is treated as likelihood reasoning (similar to that of Mycin), then natural solutions emerge for several of the problems that are encountered whendefault reasoning is used.

Abstract

Several attempts to define formal logic5 for some type of default reasoning have been made. All of these logics share the property that in any given state, a proposition p is either held to be true, it is held to be false, or no belief about it is held. But, if we ask what default reasoning really is, we see that it is form of likelihood reasoning. The goal of this paper is to show that if default reasoning is treated as likelihood reasoning (similar to that of Mycin), then natural solutions emerge for several of the problems that are encountered when default reasoning is used. This is shown by presenting 7 such problems and showing how they are solved. I.

Keywords

Computer Science

Artificial IntelligenceA logic for default reasoning

3,920 Citations1980Raymond Reiter

This paper proposes a logic for default reasoning, develops a complete proof theory and shows how to interface it with a top down resolution theorem prover, and provides criteria under which the revision of derived beliefs must be effected.

Artificial IntelligenceCircumscription—A form of non-monotonic reasoning

2,012 Citations1980John McCarthy

Circumscription formalizes conjectural reasoning that humans and intelligent computer programs must often jump to the conclusion that the objects they can determine to have certain properties or relations are the only objects that do.

Artificial IntelligenceNon-monotonic logic I

891 Citations1980Drew McDermott, Jon Doyle

A model and proof theories, a proof procedure, and applications for one non-monotonic logic are developed, and it is proved the completeness of the non-Monotonic predicate calculus and the decidability of theNon- monotonic sentential calculus.

View PDF

Elsevier eBooksWHAT'S IN A LINK

790 Citations1975William A. Woods

The chapter presents the logical inadequacies of almost all current network notations for representing quantified information and also discusses some of the disadvantages of a few logically adequate techniques.

NETL: A System for Representing and Using Real-World Knowledge

528 Citations1979Scott E. Fahlman

A simulator for the parallel network system has been implemented in MACLISP, and an experimental version of NETL, a language for storing real-world information in such a network, is running on this simulator.

Elsevier eBooksREASONING FROM INCOMPLETE KNOWLEDGE

158 Citations1975Allan Collins, Eleanor H. Warnock +2 more

This chapter describes this kind of human reasoning in terms of how a computer can be made to reason in the same illogical way as human reasoning, and presents SCHOLAR, a computer program whose knowledge about the world is stored in a semantic network structured like human memory.

Artificial IntelligenceExtended inference modes in reasoning by computer systems

57 Citations1980Terry Winograd

The history of process-dependent reasoning in AI systems is reviewed, and it is argued that it represents an essentially different approach to non-monotonic reasoning from other formalizations.

Computational LinguisticsSOME REPRESENTATIONAL ISSUES IN DEFAULT REASONING

34 Citations1983Raymond Reiter, Giovanni Criscuolo

Network representations fail to reason correctly with defaults, but when viewed as indexing schemes on logical formulae, networks can be seen to provide computationally feasible heuristics for the consistency checks required by default reasoning.