DeepAI AI Chat
Log In Sign Up

Descriptor Revision for Conditionals: Literal Descriptors and Conditional Preservation

by   Kai Sauerwald, et al.
FernUniversität in Hagen

Descriptor revision by Hansson is a framework for addressing the problem of belief change. In descriptor revision, different kinds of change processes are dealt with in a joint framework. Individual change requirements are qualified by specific success conditions expressed by a belief descriptor, and belief descriptors can be combined by logical connectives. This is in contrast to the currently dominating AGM paradigm shaped by Alchourrón, Gärdenfors, and Makinson, where different kinds of changes, like a revision or a contraction, are dealt with separately. In this article, we investigate the realisation of descriptor revision for a conditional logic while restricting descriptors to the conjunction of literal descriptors. We apply the principle of conditional preservation developed by Kern-Isberner to descriptor revision for conditionals, show how descriptor revision for conditionals under these restrictions can be characterised by a constraint satisfaction problem, and implement it using constraint logic programming. Since our conditional logic subsumes propositional logic, our approach also realises descriptor revision for propositional logic.


page 1

page 2

page 3

page 4


Belief merging within fragments of propositional logic

Recently, belief change within the framework of fragments of proposition...

On the Link between Partial Meet, Kernel, and Infra Contraction and its Application to Horn Logic

Standard belief change assumes an underlying logic containing full class...

Conditional indifference and conditional preservation

The idea of preserving conditional beliefs emerged recently as a new par...

Probabilistic Belief Change: Expansion, Conditioning and Constraining

The AGM theory of belief revision has become an important paradigm for i...

Content-Based Bird Retrieval using Shape context, Color moments and Bag of Features

In this paper we propose a new descriptor for birds search. First, our w...

A Constraint Logic Programming Approach for Computing Ordinal Conditional Functions

In order to give appropriate semantics to qualitative conditionals of th...

Choice Revision

Choice revision is a sort of non-prioritized multiple belief revision, i...