Descriptor Revision for Conditionals: Literal Descriptors and Conditional Preservation

TL;DR

This paper extends descriptor revision to conditional logic, focusing on literal descriptors and conditional preservation, and implements it via constraint logic programming, covering propositional logic as a special case.

Contribution

It introduces a framework for descriptor revision in conditional logic with literal descriptors, applying conditional preservation and constraint programming techniques.

Findings

Characterizes descriptor revision for conditionals as a constraint satisfaction problem.

Demonstrates implementation of the approach using constraint logic programming.

Generalizes the method to propositional logic, encompassing existing belief revision frameworks.

Abstract

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\'on, G\"ardenfors, 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.