Credulous Nonmonotonic Inference

نویسنده

  • Alexander Bochman
چکیده

We present a formal characterization and semantic representation for a number of credulous inference relations based on the notion of a,n epistemic state. It is shown, in particular, that credulous inference can be naturally represented in terms of expectations (see [Gardenfors and Makinson, 1994]). We describe also the relationships between credulous and usual skeptical nonmonotonic inference and show how they can facilitate each other.

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

ثبت نام

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

منابع مشابه

Axiomatization of Credulous Reasoning in Rational Default Logic

Nonmonotonic reasoning is succesfully formalized by the class of default logics. In this paper we introduce an axiomatic system for credulous reasoning in rational default logic. Based on classical sequent calculus and anti-sequent calculus, an abstract characterization of credulous nonmonotonic default inference in this variant of default logic is presented.

متن کامل

Eecient Credulous Inheritance Reasoning

We present a new deenition for calculating credulous extensions of simple nonmonotonic inheritance networks. In such networks, coupling (a form of coherence introduced by Touretzky) was believed to create intractability problems. Our deenition allows for tractable inference, and we argue that it provides a more intuitive account of inheritance reasoning than Touretzky's original, intractable, d...

متن کامل

Nonmonotonic Inheritance, Argumentation and Logic Programming

We study the conceptual relationship between the semantics of nonmonotonic inheritance reasoning and argumentation. We show that the credulous semantics of nonmonotonic inheritance network can be captured by the stable semantics of argumentation. We present a transformation of nonmonotonic inheritance networks into equivalent extended logic programs.

متن کامل

Disjunctive Logic Programming as

Earlier, we have proposed a logic, called priority logic 16, 18], where a theory consists of a collection of logic programming-like inference rules (without default negation) and a priority constraint among them. We showed that nonmonotonic reasoning in general can be viewed as a reasoning based on selecting monotonic inferences that satisfy the speciied priority constraints. The goal of this p...

متن کامل

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


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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 1999