Reasoning about permitted announcements ( extended

نویسندگان

  • P. Balbiani
  • H. van Ditmarsch
  • P. Seban
چکیده

Four players are playing the french game ”la belote”. All the 32 cards are dealt, each player starts the game with eight cards and she knows them, and all of this is common knowledge. We can formalize this situation using epistemic logic (see [8] for more details): the set of propositional atoms of our language is {(V C)i|V ∈ {7, 8, 9, 10, J,Q,K,A}, C ∈ {♣,♥,♦,♠}, i ∈ {1, 2, 3, 4}}. The model of ”la belote” has four epistemic (equivalence) relations, a world corresponds to a deal, and we say that M, s |= (10♠)3 if player 3 has the ten of spades in the deal s. Then we can express sentences like ”player 2 knows that player 3 has the queen of hearts” (K2(Q♥)3). What is happening when the game starts? Player one playing the 7 of diamonds can be seen as the public announcement that player one has the 7 of diamonds. But she may be able to do such an announcement, because she actually has the 7 of diamonds, without having the permission to do it, because the rules of the game may forbid it to her. Which are the announcements that are permitted in this game, depending on the actual situation? This paper will try to answer this question. Our goal is to formalize the concept of ”having the permission to say”. The way we choose is to adapt the semantics considered in [11] in the particular case where actions are replaced by public announcements. Thus, for α in van der Meyden’s ♦(α,φ) we take an announcement ψ! such that ♦(ψ!, φ) now means ‘it is permitted to announce ψ, after which φ is true’. The primitive of our language is in fact somewhat different, as it also takes sequences of announcements into account, but we will be able to define such ♦(ψ!, φ) as a special case (see section 4.1). The logic of public announcements (PAL) proposed by Plaza in [9], which is an extension of epistemic logic, permits to express the way agents update their knowledge after public announcements of true propositions. We can for example write in this language 〈ψ〉φ which means that after the truthful public

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reasoning About Permitted Announcements

We formalize what it means to have permission to say something. We adapt the dynamic logic of permission by van der Meyden [22] to the case where atomic actions are public truthful announcements. We also add a notion of obligation. Our logic is an extension of the logic of public announcements introduced by Plaza [17] with dynamic modal operators for permission and for obligation. We axiomatize...

متن کامل

The Deontic Component of Action Language nC+

The action language C+ of Giunchiglia, Lee, Lifschitz, McCain, and Turner is a formalism for specifying and reasoning about the effects of actions and the persistence (‘inertia’) of facts over time. An ‘action description’ in C+ defines a labelled transition system of a certain kind. nC+ (formerly known as (C+)) is an extended form of C+ designed for representing normative and institutional asp...

متن کامل

(C+)++: An Action Language for Modelling Norms and Institutions

The language C+ of Giunchiglia, Lee, Lifschitz, McCain, and Turner (2004) is a formalism for specifying and reasoning about the effects of actions and the persistence (‘inertia’) of facts over time. An ‘action description’ in C+ is a set of C+ laws which define a labelled transition system of a certain kind. This document presents (C+), an extended form of C+ designed for representing norms of ...

متن کامل

Permission Accounting in Separation Logic ( extended abstract )

Separation logic began by describing total separation between the heap space used by separate parts of a program. It has moved on to consider how total and partial permissions to access heap elements can be transferred between concurrent threads. The roots of the new approach are in Boyland’s [3] demonstration of the utility of fractional permissions in reasoning about programs. We add the noti...

متن کامل

TR-2007025: Public Communication in Justification Logic

Justification Logic is the study of a family of logics used to reason about justified true belief. Dynamic Epistemic Logic is the study of a family of logics obtained by adding various kinds of communication to the language of multi-modal logic, yielding languages for reasoning about communication and true belief. This paper is a first-step in merging these two areas, in that it brings the most...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009