A Theory of Nonmonotonic Rule Systems

نویسندگان

  • Victor W. Marek
  • Anil Nerode
  • Jeffrey B. Remmel
چکیده

In mathematics, a consequence drawn by a deduction from a set of premises can also drawn by the same deduction from any larger set of premises. The deduction remains a deduction no matter how the axioms are increased. This is monotonic reasoning, much imitated in other, less certain, disciplines. The very nature of monotonic reasoning makes mathematical proofs permanent, independent of new information. Thus it has been since Euclid and Aristotle. Theorems with complete proofs are never withdrawn due to later knowledge. It is little exaggeration to say that mathematicians never reject the completed proofs of their predecessors, except to complain about their constructivity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Nonmonotonic Rule System using Ontologies

The development of the Semantic Web proceeds in layers. Currently the most advanced layer that has reached maturity is the ontology layer, in the form of the DAML+OIL language which corresponds to a rich description logic. The next step will be the the realization of logical rule systems on top of the ontology layer. Computationally simple nonmonotonic rule systems show promise to play an impor...

متن کامل

Nonmonotonic rule systems with recursive sets of restraints

Abstract We study nonmonotonic rule systems with rules that admit infinitely many restraints. We concentrate on the case when the constraints of rules form a recursive sets and there is a uniform enumeration of codes for rules. We show that the theory developed for nonmonotnic rule systems admitting the rules with finite number of restraints can be lifted to such rule systems. We give tight est...

متن کامل

A Context for Belief Revision: Forward Chaining - Normal Nonmonotonic Rule Systems

A number of nonmonotonic reasoning formalism have been introduced to model the set of beliefs of an agent. For example, Reiter [Rei80] introduced default logic where the set of beliefs of an agent reasoning with incomplete information corresponded to a extension of a default theory < D,W >. In the realm of logic programming, the stable models of a general logic program as introduced by Gelfond ...

متن کامل

Semantics for Constrained and Rational Default Logics

The default nonmonotonic reasoning was formalised by a class of logical systems: default logics (classical, justified, constrained, rational), based on the same syntax which utilises nonmonotonic inference rules: defaults, but with different semantics for the defaults. In this paper we introduce a uniform semantic characterisation for the constrained and rational extensions of a default theory....

متن کامل

From systems to logic in the early development of nonmonotonic reasoning

This note recounts the author’s recollections of how the notion of nonmonotonic reasoning emerged in artificial intelligence from 1967 and during a ten-year period. I describe the interplay between three kinds of activities: design of high-level programming systems for AI, design of truth-maintenance systems, and the development of nonmonotonic logics. This was not a development from logic to i...

متن کامل

Rationality in human nonmonotonic inference

This article tests human inference rationality when dealing with default rules. To study human rationality, psychologists currently use classical models of logic or probability theory as normative models for evaluating human ability to reason rationally. Our position is that this approach is convincing, but only manages to capture a specific case of inferential ability with little regard to con...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1990