The lexicographic closure as a revision process

Journal of Applied Non-Classical Logics 11 (1):35-58 (2001)
  Copy   BIBTEX

Abstract

The connections between nonmonotonic reasoning and belief revision are well-known. A central problem in the area of nonmonotonic reasoning is the problem of default entailment, i.e., when should an item of default information representing “if θ is true then, normally, φ is true” be said to follow from a given set of items of such information. Many answers to this question have been proposed but, surprisingly, virtually none have attempted any explicit connection to belief revision. The aim of this paper is to give an example of how such a connection can be made by showing how the lexicographic closure of a set of defaults may be conceptualised as a process of iterated revision by sets of sentences. Specifically we use the revision method of Nayak.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,813

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2014-01-21

Downloads
37 (#442,474)

6 months
15 (#185,169)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Richard Booth
Cardiff University

Citations of this work

Dynamic belief revision operators.Abhaya C. Nayak, Maurice Pagnucco & Pavlos Peppas - 2003 - Artificial Intelligence 146 (2):193-228.
Adaptively applying modus ponens in conditional logics of normality.Christian Straßer - 2012 - Journal of Applied Non-Classical Logics 22 (1):125-148.

Add more citations