The lexicographic closure as a revision process

DOI10.3166/JANCL.11.35-58MaRDI QIDQ4443391zbMATH OpenOpenAlexFDO

Authors Richard Booth

Publication date 11 January 2004

Published in Journal of Applied Non-Classical Logics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/cs/0003017

zbMATH Keywords

belief revisiondefault reasoningepistemic entrenchmentiterated revisionnonmonotonic reasoningrational consequence

Mathematics Subject Classification ID

Logics of knowledge and belief (including belief change) (03B42) Logic in artificial intelligence (68T27)

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 A is true then, normally, B 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 process of Nayak.

Recommendations

• Another perspective on default reasoning
• Default reasoning and belief revision: A syntax-independent approach
• scientific article; zbMATH DE number 1785006
• scientific article; zbMATH DE number 140406
• scientific article; zbMATH DE number 4160167

Cites work

• A survey of multiple contractions
• Another perspective on default reasoning
• Belief change as change in epistemic entrenchment
• Belief revision: A critique
• Injective Models and Disjunctive Relations
• Iterated revision and minimal change of conditional beliefs
• Modellings for belief change: Prioritization and entrenchment*
• Nonmonotonic inference based on expectations
• Nonmonotonic reasoning, preferential models and cumulative logics
• On the logic of iterated belief revision
• On the logic of theory change: Partial meet contraction and revision functions
• Preferential belief change using generalized epistemic entrenchment
• Statics and dynamics of induced systems
• What does a conditional knowledge base entail?

Cited in

(3)

• Another perspective on default reasoning
• Adaptively applying modus ponens in conditional logics of normality
• Dynamic belief revision operators

This page was built for publication: The lexicographic closure as a revision process

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4443391)