Results 1 - 10
of
68
Dynamic Logic for Belief Revision
- JOURNAL OF APPLIED NON-CLASSIC LOGICS
, 2007
"... We show how belief revision can be treated systematically in the format of dynamicepistemic logic, when operators of conditional belief are added. The core engine consists of definable update rules for changing plausibility relations between worlds, which have been proposed independently in the dyn ..."
Abstract
-
Cited by 71 (11 self)
- Add to MetaCart
We show how belief revision can be treated systematically in the format of dynamicepistemic logic, when operators of conditional belief are added. The core engine consists of definable update rules for changing plausibility relations between worlds, which have been proposed independently in the dynamic-epistemic literature on preference change. Our analysis yields two new types of modal result. First, we obtain complete logics for concrete mechanisms postulates for belief revision can be analyzed by standard modal frame correspondences for model-changing operations.
The stories of logic and information
- In Handbook of the Philosophy of Information, P. Adriaans and
, 2008
"... ..."
Towards a theory of intention revision
, 2007
"... Although the change of beliefs in the face of new information has been widely studied with some success, the revision of other mental states has received little attention from the theoretical perspective. In particular, intentions are widely recognised as being a key attitude for rational agents, a ..."
Abstract
-
Cited by 15 (2 self)
- Add to MetaCart
Although the change of beliefs in the face of new information has been widely studied with some success, the revision of other mental states has received little attention from the theoretical perspective. In particular, intentions are widely recognised as being a key attitude for rational agents, and while several formal theories of intention have been proposed in the literature, the logic of intention revision has been hardly considered. There are several reasons for this: perhaps most importantly, intentions are very closely connected with other mental states—in particular, beliefs about the future and the abilities of the agent. So, we cannot study them in isolation. We must consider the interplay between intention revision and the revision of other mental states, which complicates the picture considerably. In this paper, we present some first steps towards a theory of intention revision. We develop a simple model of an agent’s mental states, and define intention revision operators. Using this model, we develop a logic of intention dynamics, and then investigate some of its properties.
From Preference Logics to Preference Languages, and Back
"... Preference logics and AI preference representation languages are both concerned with reasoning about preferences on combinatorial domains, yet so far these two streams of research have had little interaction. This paper contributes to the bridging of these areas. We start by constructing a “prototyp ..."
Abstract
-
Cited by 15 (2 self)
- Add to MetaCart
Preference logics and AI preference representation languages are both concerned with reasoning about preferences on combinatorial domains, yet so far these two streams of research have had little interaction. This paper contributes to the bridging of these areas. We start by constructing a “prototypical” preference logic, which combines features of existing preference logics, and then we show that many well-known preference languages, such as CP-nets and its extensions, are natural fragments of it. After establishing useful characterizations of dominance and consistency in our logic, we study the complexity of satisfiability in the general case as well as for meaningful fragments, and we study the expressive power as well as the relative succinctness of some of these fragments. 1.
Commands and Changing Obligations
- Proceedings of the Seventh International Workshop on Computational Logic in Multi-Agent Systems (CLIMA VII
, 2006
"... Abstract. If we are to take the notion of speech act seriously, we must be able to treat speech acts as acts. In this paper, we will try to model changes brought about by various acts of commanding in terms of a variant of update logic. We will combine a multi-agent variant of the language of monadi ..."
Abstract
-
Cited by 14 (3 self)
- Add to MetaCart
(Show Context)
Abstract. If we are to take the notion of speech act seriously, we must be able to treat speech acts as acts. In this paper, we will try to model changes brought about by various acts of commanding in terms of a variant of update logic. We will combine a multi-agent variant of the language of monadic deontic logic with a dynamic language to talk about the situations before and after the issuance of commands, and the commands that link those situations. Although the resulting logic inherits various inadequacies from monadic deontic logic, some interesting principles are captured and seen to be valid nonetheless. A complete axiomatization and some interesting valid principles together with concrete examples will be presented, and suggestions for further research will be made. 1
From belief change to preference change
- In Procs. of ECAI
, 2008
"... Abstract. Various tasks need to consider preferences in a dynamic way. We start by discussing several possible meanings of preference change, and then focus on the one we think is the most natural: pref-erences evolving after some new fact has been learned. We define a family of such preference chan ..."
Abstract
-
Cited by 10 (1 self)
- Add to MetaCart
(Show Context)
Abstract. Various tasks need to consider preferences in a dynamic way. We start by discussing several possible meanings of preference change, and then focus on the one we think is the most natural: pref-erences evolving after some new fact has been learned. We define a family of such preference change operators, parameterized by a re-vision function on epistemic states and a semantics for interpreting preferences over formulas. We list some natural properties that this kind of preference change should fulfill and give conditions on the revision function and the semantics of preference for each of these properties to hold. 1
Preference, Priorities and Belief
, 2007
"... We define preference in terms of priority sequences, a concept which is initially from optimality theory. In case agents only have incomplete information, beliefs are introduced. We propose three definitions to describe three different procedures agents may take to obtain preference from the incompl ..."
Abstract
-
Cited by 9 (3 self)
- Add to MetaCart
(Show Context)
We define preference in terms of priority sequences, a concept which is initially from optimality theory. In case agents only have incomplete information, beliefs are introduced. We propose three definitions to describe three different procedures agents may take to obtain preference from the incomplete information. Changes of preference are explored w.r.t their sources: changes of priority sequence, and changes in beliefs. We extend the results to the many agent case. Among other things this gives a new view on cooperation. 1
Global and Local Graph Modifiers
, 2009
"... We define two modal logics that allow to reason about modifications of graphs. Both have a universal modal operator. The first one only involves global modifications (of some state label, or of some edge label) everywhere in the graph. The second one also allows for modifications that are local to s ..."
Abstract
-
Cited by 8 (0 self)
- Add to MetaCart
We define two modal logics that allow to reason about modifications of graphs. Both have a universal modal operator. The first one only involves global modifications (of some state label, or of some edge label) everywhere in the graph. The second one also allows for modifications that are local to states. The global version generalizes logics of public announcements and public assignments, as well as a logic of preference modification introduced by van Benthem et Liu. By means of reduction axioms we show that it is just as expressive as the underlying logic without global modifiers. We then show that adding local modifiers dramatically increases the power of the logic: the logic of global and local modifiers is undecidable. We finally study its relation with hybrid logic with binder. Keywords: Public Announcement Logic, graph modifiers.
Propositional Dynamic Logic as a Logic of Belief Revision and Preference Change
, 2009
"... This talk shows how propositional dynamic logic (PDL) can be interpreted as a logic for multi-agent belief revision. For that we revise and extend the logic of communication and change (LCC) of [9]. Like LCC, our logic uses PDL as a base epistemic language. Unlike LCC, we start out from agent plausi ..."
Abstract
-
Cited by 8 (5 self)
- Add to MetaCart
(Show Context)
This talk shows how propositional dynamic logic (PDL) can be interpreted as a logic for multi-agent belief revision. For that we revise and extend the logic of communication and change (LCC) of [9]. Like LCC, our logic uses PDL as a base epistemic language. Unlike LCC, we start out from agent plausibilities, add their converses, and build knowledge and belief operators from these with the PDL constructs. We extend the update mechanism of LCC to an update mechanism that handles belief change as relation substitution, and we show that the update part of this logic is more expressive than either that of LCC or that of epistemic/doxastic PDL with a belief change modality. Next, we show that the properties of knowledge and belief are preserved under any update, unlike in LCC. We prove completeness of the logic and give examples of its use. If there is time, we will also look at the preference interpretation of the system, and at preference change scenarios that can be modelled with it.
