Results 1 - 10
of
283
The logic of public announcements, common knowledge, and private suspicions
, 1999
"... ..."
(Show Context)
Reasoning about Information Change
, 1997
"... In this paper, we have combined techniques from epistemic and dynamic logic to arrive at a logic for describing multi-agent information change. The key concept of dynamic semantics is that the meaning of an assertion is the way in which the assertion changes the information of the hearer. Thus a dyn ..."
Abstract
-
Cited by 129 (4 self)
- Add to MetaCart
In this paper, we have combined techniques from epistemic and dynamic logic to arrive at a logic for describing multi-agent information change. The key concept of dynamic semantics is that the meaning of an assertion is the way in which the assertion changes the information of the hearer. Thus a dynamic epistemic semantics consist in a explicit formal definition of the information change potential of a sentence. We used these ideas to arrive at the system of Dynamic Epistemic Semantics, which is semantics for a language describing information change in a multi-agent setting. This semantics proved useful for analyzing the Muddy Children paradox, and also for giving a semantics for knowledge programs, since it enabled us to model knowledge change by giving an explicit semantics to the triggers of the information change (the latter being the assertions made, or the messages sent). We feel that this is an important extension, since standard approaches to for example the Muddy Children (e.g. Fagin et al. 1995) generally use static epistemic logics like S5 to describe the situation before and after a certain epistemic event, leaving the transition between `before' and `after' to considerations in the meta-language.
Presupposition
- J.VAN BENTHEM & A.TER MEULEN (EDS.) THE HANDBOOK OF LOGIC AND LANGUAGE
, 1996
"... ..."
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.
Dynamic Logic of Preference Upgrade
- Journal of Applied Non-Classical Logics
, 2005
"... The notion of preference occurs across many areas, including the philosophy of action, decision theory, optimality theory, and game theory. In these settings, individual preferences between worlds or actions can be used to predict behavior by rational agents. In a more abstract sense, the notion of ..."
Abstract
-
Cited by 68 (18 self)
- Add to MetaCart
The notion of preference occurs across many areas, including the philosophy of action, decision theory, optimality theory, and game theory. In these settings, individual preferences between worlds or actions can be used to predict behavior by rational agents. In a more abstract sense, the notion of preference also
Desires and Defaults: A Framework for Planning with Inferred Goals
- In Proceedings KR 2000
, 2000
"... This paper develops a formalism designed to integrate reasoning about desires with planning. The resulting logic, BDP, is capable of modeling a wide range of common-sense practical arguments, and can serve as a more general and flexible model for agent architectures. ..."
Abstract
-
Cited by 56 (2 self)
- Add to MetaCart
(Show Context)
This paper develops a formalism designed to integrate reasoning about desires with planning. The resulting logic, BDP, is capable of modeling a wide range of common-sense practical arguments, and can serve as a more general and flexible model for agent architectures.
Defaults and Revision in Structured Theories
- In Proceedings of the IEEE Symposium on Logic in Computer Science (LICS'91
, 1991
"... Starting from a logic which specifies how to make deductions from a set of sentences (a `flat theory'), a way to generalise this to a partially ordered bag of sentences (a `structured theory') is given. The partial order is used to resolve conflicts. If OE occurs below / then / is accepted ..."
Abstract
-
Cited by 35 (16 self)
- Add to MetaCart
(Show Context)
Starting from a logic which specifies how to make deductions from a set of sentences (a `flat theory'), a way to generalise this to a partially ordered bag of sentences (a `structured theory') is given. The partial order is used to resolve conflicts. If OE occurs below / then / is accepted only insofar as it does not conflict with OE. We start with a language L, a set of interpretations M and a satisfaction relation fl ` M \Theta L. The key idea is to define, for each structured theory, a pre-order on interpretations. Models of the structured theory are defined to be maximal interpretations in the ordering. They are shown to exist if the logic hL; M; fli is compact. A revision operator is defined, which takes a structured theory and a sentence and returns a structured theory. The consequence relation has the properties of weak monotonicity, weak cut and weak reflexivity with respect to this operator, but fails their strong counterparts. 1 Introduction Ordering sentences in a theo...
