Uniform semantic treatment of default and autoepistemic logics

02/03/2000
by   Marc Denecker, et al.
0

We revisit the issue of connections between two leading formalisms in nonmonotonic reasoning: autoepistemic logic and default logic. For each logic we develop a comprehensive semantic framework based on the notion of a belief pair. The set of all belief pairs together with the so called knowledge ordering forms a complete lattice. For each logic, we introduce several semantics by means of fixpoints of operators on the lattice of belief pairs. Our results elucidate an underlying isomorphism of the respective semantic constructions. In particular, we show that the interpretation of defaults as modal formulas proposed by Konolige allows us to represent all semantics for default logic in terms of the corresponding semantics for autoepistemic logic. Thus, our results conclusively establish that default logic can indeed be viewed as a fragment of autoepistemic logic. However, as we also demonstrate, the semantics of Moore and Reiter are given by different operators and occupy different locations in their corresponding families of semantics. This result explains the source of the longstanding difficulty to formally relate these two semantics. In the paper, we also discuss approximating skeptical reasoning with autoepistemic and default logics and establish constructive principles behind such approximations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/05/2014

Implementing Default and Autoepistemic Logics via the Logic of GK

The logic of knowledge and justified assumptions, also known as logic of...
research
08/16/2011

Reiter's Default Logic Is a Logic of Autoepistemic Reasoning And a Good One, Too

A fact apparently not observed earlier in the literature of nonmonotonic...
research
03/13/2013

Lattice-Based Graded Logic: a Multimodal Approach

Experts do not always feel very, comfortable when they have to give prec...
research
11/30/2022

Non-Deterministic Approximation Fixpoint Theory and Its Application in Disjunctive Logic Programming

Approximation fixpoint theory (AFT) is an abstract and general algebraic...
research
08/29/1998

Plausibility Measures and Default Reasoning

We introduce a new approach to modeling uncertainty based on plausibilit...
research
05/11/2002

Ultimate approximations in nonmonotonic knowledge representation systems

We study fixpoints of operators on lattices. To this end we introduce th...
research
07/22/2019

An Algebraic Approach for Action Based Default Reasoning

Often, we assume that an action is permitted simply because it is not ex...

Please sign up or login with your details

Forgot password? Click here to reset