Results 1 
3 of
3
Epistemic actions as resources
 Journal of Logic and Computation
, 2007
"... We provide algebraic semantics together with a sound and complete sequent calculus for information update due to epistemic actions. This semantics is flexible enough to accommodate incomplete as well as wrong information e.g. deceit. We give a purely algebraic treatment of the muddy children puzzle, ..."
Abstract

Cited by 18 (13 self)
 Add to MetaCart
We provide algebraic semantics together with a sound and complete sequent calculus for information update due to epistemic actions. This semantics is flexible enough to accommodate incomplete as well as wrong information e.g. deceit. We give a purely algebraic treatment of the muddy children puzzle, which moreover extends to situations where the children are allowed to lie and cheat. Epistemic actions, that is, information exchanges between agents A, B,... ∈ A, are modeled as elements of a quantale, hence conceiving them as resources. Indeed, quantales are to locales what monoidal closed categories are to Cartesian closed categories, respectively providing semantics for Intuitionistic Logic, and for noncommutative Intuitionistic Linear Logic, including Lambek calculus. The quantale (Q, � , •) acts on an underlying Qright module (M, � ) of epistemic propositions and facts. The epistemic content is encoded by appearance maps, one pair f M A: M → M and f Q A: Q → Q of (lax) morphisms for each agent A ∈ A. By adjunction, they give rise to epistemic modalities [12], capturing the agents ’ knowledge on propositions and actions. The module action is epistemic update and gives rise to dynamic modalities [20] — cf. weakest preconditions. This model subsumes the crucial fragment of Baltag, Moss and Solecki’s [6] dynamic epistemic logic, abstracting it in a constructive fashion while introducing resourcesensitive structure on the epistemic actions. Keywords: Multiagent communication, knowledge update, resourcesensitivity, quantale, Galois adjoints, dynamic epistemic logic, sequent calculus, Lambek calculus, Linear Logic.
Algebra and Sequent Calculus for Epistemic Actions
 ENTCS PROCEEDINGS OF LOGIC AND COMMUNICATION IN MULTIAGENT SYSTEMS (LCMAS) WORKSHOP, ESSLLI 2004
, 2005
"... We introduce an algebraic approach to Dynamic Epistemic Logic. This approach has the advantage that: (i) its semantics is a transparent algebraic object with a minimal set of primitives from which most ingredients of Dynamic Epistemic Logic arise, (ii) it goes with the introduction of nondeterminis ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
We introduce an algebraic approach to Dynamic Epistemic Logic. This approach has the advantage that: (i) its semantics is a transparent algebraic object with a minimal set of primitives from which most ingredients of Dynamic Epistemic Logic arise, (ii) it goes with the introduction of nondeterminism, (iii) it naturally extends beyond boolean sets of propositions, up to intuitionistic and nondistributive situations, hence allowing to accommodate constructive computational, informationtheoretic as well as nonclassical physical settings, and (iv) introduces a structure on the actions, which now constitute a quantale. We also introduce a corresponding sequent calculus (which extends Lambek calculus), in which propositions, actions as well as agents appear as resources in a resourcesensitive dynamicepistemic logic.
Reasoning about Dynamic Epistemic Logic
"... We present an algebra and sequent calculus to reason about dynamic epistemic logic, a logic for information update in multiagent systems. We contribute to it by equipping it with a logical account of resources, a semiautomatic way of reasoning through the algebra and sequent calculus, and finally ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We present an algebra and sequent calculus to reason about dynamic epistemic logic, a logic for information update in multiagent systems. We contribute to it by equipping it with a logical account of resources, a semiautomatic way of reasoning through the algebra and sequent calculus, and finally by generalizing it to nonboolean settings. Dynamic Epistemic Logic (DEL) is a PDLstyle logic [14] to reason about epistemic actions and updates in a multiagent system. It focuses in particular on epistemic programs, i.e. programs that update the information state of agents, and it has applications to modelling and reasoning about informationflow and information exchange between agents. This is a major problem in several fields such as secure communication where one has to deal with the privacy and authentication of communication protocols, software reliability for concurrent programs, Artificial Intelligence where agents are to be provided with reliable tools to reason about their environment and each other’s knowledge, and ecommerce where agents need to have knowledge acquisition strategies over complex networks. The standard approach to information flow in a multiagent system has been presented in [8] but it does not present a formal description of epistemic programs and their updates. The first attempts to