scispace - formally typeset
Open AccessProceedings Article

Semantical considerations on nonmonotonic logic

Reads0
Chats0
TLDR
In this paper, the authors give a reconstruction of non-monotonic logic as a model of an Ideally rational agent's reasoning about his own beliefs, and define an Intuitively based semantics for which they can show autoeplstemlc logic to be both sound and complete.
Abstract: 
Commonsense reasoning is "nonmonotonic" in the sense that we often draw conclusions on the basis of partial information that we retract when we are given more complete information. Some of the most interesting products of the recent attempts to formalize nonmonotonic reasoning are the nonmonotonic logics of McDermott and Doyle [McDermott and Doyle, 1980] [McDermott, 1982]. These logics, however, all have peculiarities that suggest they do not quite succeed in capturing the intuitions that prompted their development. In this paper we give a reconstruction of nonmonotonic logic as a model of an Ideally rational agent's reasoning about his own beliefs. For the resulting system, called autoeplstemlc logic, we define an Intuitively based semantics for which we can show autoeplstemlc logic to be both sound and complete. We then compare the McDermott and Doyle logics to autoeplstemlc logic, showing how it avoids their peculiarities.

read more

Content maybe subject to copyright    Report

Citations
More filters
Book

Foundations of logic programming

TL;DR: This is the second edition of an account of the mathematical foundations of logic programming, which collects, in a unified and comprehensive manner, the basic theoretical results of the field, which have previously only been available in widely scattered research papers.
Journal ArticleDOI

On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n -person games

TL;DR: By showing that argumentation can be viewed as a special form of logic programming with negation as failure, this paper introduces a general logic-programming-based method for generating meta-interpreters for argumentation systems, a method very much similar to the compiler-compiler idea in conventional programming.
Journal ArticleDOI

Classical negation in logic programs and disjunctive databases

TL;DR: It is shown that some facts of commonsense knowledge can be represented by logic programs and disjunctive databases more easily when classical negation is available.
Journal ArticleDOI

The well-founded semantics for general logic programs

TL;DR: It is shown that the class of programs possessing a total well-founded model properly includes previously studied classes of "stratified" and "locally stratified" programs, and is compared with other proposals in the literature.
Book

Artificial Intelligence: A New Synthesis

TL;DR: Intelligent agents are employed as the central characters in this new introductory text and Nilsson gradually increases their cognitive horsepower to illustrate the most important and lasting ideas in AI.
References
More filters
Book ChapterDOI

A framework for representing knowledge

Marvin Minsky
TL;DR: The enormous problem of the volume of background common sense knowledge required to understand even very simple natural language texts is discussed and it is suggested that networks of frames are a reasonable approach to represent such knowledge.
Journal ArticleDOI

Non-monotonic logic I

TL;DR: 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.
Journal ArticleDOI

Nonmonotonic Logic II: Nonmonotonic Modal Theories

TL;DR: The operator M (usually read "possible") is extended so that Mp is true whenever p is consistent with the theory, and any theorem of this form may be mvahdated if ~p ~s is added as an axiom.