Another perspective on Default Reasoning

03/01/2002
by   Daniel Lehmann, et al.
0

The lexicographic closure of any given finite set D of normal defaults is defined. A conditional assertion "if a then b" is in this lexicographic closure if, given the defaults D and the fact a, one would conclude b. The lexicographic closure is essentially a rational extension of D, and of its rational closure, defined in a previous paper. It provides a logic of normal defaults that is different from the one proposed by R. Reiter and that is rich enough not to require the consideration of non-normal defaults. A large number of examples are provided to show that the lexicographic closure corresponds to the basic intuitions behind Reiter's logic of defaults.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/08/2014

Rational Closure in SHIQ

We define a notion of rational closure for the logic SHIQ, which does no...
research
03/07/2000

The lexicographic closure as a revision process

The connections between nonmonotonic reasoning and belief revision are w...
research
02/11/2023

An Evaluation Algorithm for Datalog with Equality

We describe an evaluation algorithm for relational Horn logic (RHL). RHL...
research
02/13/2013

Coping with the Limitations of Rational Inference in the Framework of Possibility Theory

Possibility theory offers a framework where both Lehmann's "preferential...
research
04/01/2016

A strengthening of rational closure in DLs: reasoning about multiple aspects

We propose a logical analysis of the concept of typicality, central in h...
research
11/10/2021

A Hierarchy of Network Models Giving Bistability Under Triadic Closure

Triadic closure describes the tendency for new friendships to form betwe...

Please sign up or login with your details

Forgot password? Click here to reset