This paper presents a new modal logic for ceteris paribus preferences understood in the sense of "all other things being equal". This reading goes back to the seminal work of Von Wright in the early 1960's and has returned in computer science in the 1990' s and in more abstract "dependency logics" today. We show how it differs from ceteris paribus as "all other things being normal", which is used in contexts with preference defeaters. We provide a semantic analysis and (...) several completeness theorems. We show how our system links up with Von Wright's work, and how it applies to game-theoretic solution concepts, to agenda setting in investigation, and to preference change. We finally consider its relation with infinitary modal logics. (shrink)

Statements not only update our current knowledge, but also have other dynamic effects. In particular, suggestions or commands ?upgrade' our preferences by changing the current order among worlds. We present a complete logic of knowledge update plus preference upgrade that works with dynamic-epistemic-style reduction axioms. This system can model changing obligations, conflicting commands, or ?regret'. We then show how to derive reduction axioms from arbitrary definable relation changes. This style of analysis also has a product update version with preferences between (...) actions, as well as worlds. Some illustrations are presented involving defaults and obligations. We conclude that our dynamic framework is viable, while admitting a further extension to more numerical ?utility update'. (shrink)

This paper presents a new modal logic for ceteris paribus preferences understood in the sense of “all other things being equal”. This reading goes back to the seminal work of Von Wright in the early 1960’s and has returned in computer science in the 1990’s and in more abstract “dependency logics” today. We show how it differs from ceteris paribus as “all other things being normal”, which is used in contexts with preference defeaters. We provide a semantic analysis and several (...) completeness theorems. We show how our system links up with Von Wright’s work, and how it applies to game-theoretic solution concepts, to agenda setting in investigation, and to preference change. We finally consider its relation with infinitary modal logics. (shrink)

A possible world semantics for preference is developed. The remainder operator () is used to give precision to the notion that two states of the world are as similar as possible, given a specified difference between them. A general structure is introduced for preference relations between states of affairs, and three types of such preference relations are defined. It is argued that one of them, actual preference, corresponds closely to the concept of preference in informal discourse. Its logical properties are (...) studied and shown to be plausible. (shrink)

Logic programs under answer set semantics have become popular as a knowledge representation formalism in Artificial Intelligence. In this paper we investigate the possibility of using answer sets for qualitative decision making. Our approach is based on an extension of the formalism, called logic programs with ordered disjunction (LPODs). These programs contain a new connective called ordered disjunction. The new connective allows us to represent alternative, ranked options for problem solutions in the heads of rules: A × B intuitively means: (...) if possible A, but if A is not possible then at least B. The semantics of logic programs with ordered disjunction is based on a preference relation on answer sets. We show that LPODs can serve as a basis for qualitative decision making. (shrink)