A Logic for Default Reasoning

@article{Reiter1987ALF,
  title={A Logic for Default Reasoning},
  author={Raymond Reiter},
  journal={Artif. Intell.},
  year={1987},
  volume={13},
  pages={81-132}
}
  • R. Reiter
  • Published 1 October 1987
  • Philosophy, Computer Science, Economics
  • Artif. Intell.
View via Publisher
umiacs.umd.edu
4,418 Citations
Highly Influential Citations
386
Background Citations
1,697
Methods Citations
578
Results Citations
65

Figures from this paper

4,418 Citations

Default Reasoning as Likelihood Reasoning

  • E. Rich
  • Philosophy, Computer Science
    AAAI
  • 1983
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.

Default Reasoning with a Constraint Resolution Principle

This work creates a resolution based system for default reasoning where an explicit control set can be built during reasoning and where default assumptions made in a deduction are remembered as constraints.

A Logical Framework for Default Reasoning

  • D. Poole
  • Computer Science, Philosophy
    Artif. Intell.
  • 1988

Reasoning by Cases in Default Logic

  • N. Roos
  • Philosophy, Computer Science
    Artif. Intell.
  • 1998

A Framework for Cumulative Default Logics

We present a framework for default reasoning which has its roots in Reiter's Default Logic. Contrary to Reiter, however, we do not consider defaults as inference rules used to generate extensions of…

Default Reasoning with Inconsistent Knowledge

It is proven that the bi-default logic is a generalization of the default logic in the presence of inconsistency.

Belief revision in a framework for default reasoning

  • G. Brewka
  • Computer Science
    The Logic of Theory Change
  • 1989
We present an approach which provides a common solution to problems recently addressed in two different research areas: nonmonotonic reasoning and theory revision. We define a framework for default…

On the consistency of commonsense reasoning

Standard cases of default reasoning formalisms in the literature (circumscription, default logic, and nonmonotonic logic), where it turns out that even weaker hypotheses lead to failure to achieve commonsense default conclusions.

A tutorial on default reasoning

  • G. Antoniou
  • Computer Science, Philosophy
    The Knowledge Engineering Review
  • 1998
This paper discusses in depth one particular approach, default logic, including properties, semantics and computational models, which is concerned with making inferences in cases where the information at hand is incomplete.

A base logic for default reasoning

An in depth analysis of the basic features of default reasoning is provided, and a minimal logic system M ofdefault reasoning that accommodates Modus Ponens for Default Implication and suitable for local inferences is proposed, and its soundness is proved.
...

References

SHOWING 1-10 OF 43 REFERENCES

On Reasoning by Default

This paper surveys a number of kinds of default reasoning in Artificial Intelligence, specifically, default assignments to variables, the closed world assumption, the frame default for causal worlds,…

A Note on Deduction Rules with Negative Premises

The so called frame axioms problem or frame problem is well-known to anybody who is interested in automatic problem solving and the author proposes to eliminate the frameAxioms in such a way that they are replaced by a new deduction rule denoted as UNLESS-operator, which leads to a new and very interesting modification of the notion of formalized theory.

Non-Monotonic Logic I

The Logic of Frames

Truth Maintenance Systems for Problem Solving

It is shown that reasoning programs which take care to record the logical justifications for program beliefs can apply several powerful, but simple, domain-independent algorithms to maintain the consistency of program beliefs and realize substantial search efficiencies.

A Linear Format for Resolution

The Resolution procedure of J. A. Robinson is shown to remain a complete proof procedure when the refutations permitted are restricted so that clauses C and D and resolvent R of clauses C and D meet…

On Closed World Data Bases

  • R. Reiter
  • Computer Science
    Logic and Data Bases
  • 1977
This paper shows that closed world evaluation of an arbitrary query may be reduced to open world evaluated of so-called atomic queries, and shows that the closed world assumption can lead to inconsistencies, but for Horn data bases no such inconsistencies can arise.

SOME PHILOSOPHICAL PROBLEMS FROM THE STANDPOINT OF ARTI CIAL INTELLIGENCE

Extracting Information from Resolution Proof Trees

Logic for problem solving

  • R. Kowalski
  • Psychology
    The computer science library : Artificial intelligence series
  • 1979
This book investigates the application of logic to problem-solving and computer programming. It assumes no previous knowledge of these fields, and may be Karl duncker in addition to make difficult…