Dynamic Epistemic Logic with Assignment

Recommend Documents

Analyzing Communication with Dynamic Epistemic Logic

The following Sum and Product riddle was stated by the Dutch mathematican Hans Freudenthal in a. Dutch mathematics journal in 1969: A says to S and P: I ...

Games in Dynamic-Epistemic Logic

Games as structures for logical languages: a first glance. 1.1. Modal logic of actions The pictures in a typical game theory text have an immediate appeal to a ...

Extending Probabilistic Dynamic Epistemic Logic - CiteSeerX

bilistic dynamic epistemic logic provided in Kooi's paper. [8]. Kooi's probabilistic dynamic epistemic logic adds ... pr

Probabilistic Dynamic Epistemic Logic - Semantic Scholar

discussed, including the Monty Hall Dilemma. Key words: Dynamic logic, epistemic logic, higher order information, probability, updates. 1. Introduction.

An inquisitive dynamic epistemic logic - Google Sites

Dec 2, 2011 - is an equivalence relation on W. â¢ V is a function that assigns a truth value to every atomic sentence i

Inquisitive dynamic epistemic logic - Google Sites

Dec 23, 2012 - sues by asking questions, and resolve these issues by making assertions. .... basic public announcement l

THE SURPRISE EXAMINATION IN DYNAMIC EPISTEMIC LOGIC ...

The large number of papers on the puzzle of the surprise exam is perhaps .... 3. BLINDSPOT. To simplify somewhat, let us suppose that the teacher makes his.

Intuitionistic Epistemic Logic - CiteSeerX

Jun 9, 2014 - 365 Fifth Avenue, rm. 4329 ..... generalisation Somebody stole your wallet in the Rome subway. ...... He claims that this second consequence is.

A Simplicial Complex Model for Dynamic Epistemic Logic to

model that represents the so-called immediate snapshot communication patterns of ... the best of our knowledge it has not been used to study fault-tolerant ...

Bridging learning theory and dynamic epistemic logic - Semantic Scholar

Apr 23, 2009 - dynamic epistemic logic and learning by erasing in dynamic ... hn will refer to a hypothesis, i.e., a finite description of a set, a Turing machine.

Learning by Erasing in Dynamic Epistemic Logic - Nina Gierasimczuk

Abstract. This work provides a comparison of learning by erasing [1] and iterated epistemic update [2] as analyzed in dynamic epistemic logic. (see e.g. [3]).

Reducing Dynamic Epistemic Logic to PDL by Program ... - CiteSeerX

Dec 7, 2004 - By the induction hypothesis, such a path exists iff (w, w ) â [[(KA kkk. (Ï))â]]M iff (w, ..... Tech. rep., Dept of Cognitive Science, Indiana University.

Schematic Validity in Dynamic Epistemic Logic - UC Berkeley ...

are therefore corollaries of completeness and decidability for multi-agent S5. ... [14], it is possible to develop a variant of PAL, which we call Uniform Public An ..... Conference on Theoretical Aspects of Rationality and Knowledge (TARK 98), pp.

From Situation Calculus to Dynamic Epistemic Logic - Semantic Scholar

Feb 1, 2010 - Hans van Ditmarsch ... we here show that for a reasonably large subset of Reiter's basic action ... However, Reiter proved decidability of a.

Dynamic Epistemic Logic and Knowledge Puzzles - Semantic Scholar

Harvard University Press, Cam- bridge (MA) (1969) ... Moses, Y.O., Dolev, D., Halpern, J.Y.: Cheating husbands and other stories: a case study in knowledge, ...

Sum and Product in Dynamic Epistemic Logic - Department of

mation in the riddle can be represented in the traditional way by number pairs, so that ... â Computer Science, University of Otago, New Zealand, [email protected]. â¡Computer ..... in 1940 in The Penguin Problems Book [WS40, p.53]: .... Formula

Epistemic Extension of Godel Logic

Jun 1, 2016 - recursively axiomatized logic extending S5. ... (s, sâ²) â S Ã S. We call it the indistinguishing function. ...... Proc. of the Joint Conference.

Epistemic Closure and Epistemic Logic I - Berkeley Philosophy

believe, let alone know, the consequences of what they knowâa fact that raises ..... been c0, student B would (or at least might) still have thought it was c, since.

An Epistemic logic for Planning with Trials ... - Semantic Scholar

An Epistemic logic for Planning with Trials. Rajdeep Niyogi ... planning problem : domain description + initial state + objectives ... states: 1. only positive literals.

Dynamic Logic

Circuits. Lecture 19. Dynamic Logic. EE141. 2. EECS141. 2. Lecture #19. Administrative Stuff. ❑ Project phase 1 due on Thursday. ▫ Report template posted on ...

Dynamic logic

CMOS Logic Circuit Design by John P. Uyemura, 2002. Dynamic CMOS. In static circuits at every point in time (except when switching) the output is connected to.

The logic of ontic and epistemic change

Oct 14, 2006 - Department of Computer Science,. University of Otago. Technical Report OUCS-2006-11. The logic of ontic and epistemic change. Authors:.

Persistence and Minimality in Epistemic Logic

The analysis of honesty generally depends on the epistemic background logic. What is ..... and ' = Th(MS;'), it follows that hMS;'i hM; wi, and so hMS;'i is.

Epistemic Logic and Epistemology - UC Berkeley Philosophy

we begin with basic epistemic logic as it descends from Hintikka [1962] (Â§2-3), ..... objects, âYou can't wait until the last day, day n, to give the exam, because if.

Dynamic Epistemic Logic with Assignment

Download PDF

1 downloads 0 Views 186KB Size Report

Comment

agenda by AlchourrÑon et al. .... offact u al states or j ust states, accessi b ility ~ : NâV ( SxS ) ...... by Alexandru Baltag and others [4], and by an van Eij ck.

Dynamic Epistemic Logic with Assignment H.P. van Ditmarsch

W. van der Hoek

B.P. Kooi

Computer Science University of Otago New Zealand

Computer Science University of Liverpool United Kingdom

Philosophy University of Groningen the Netherlands

[email protected]

[email protected]

[email protected]

!

"#$ % & %' '( % )* +! ',+- "/.0213%2- 45',+- "/"6', 7'2 8 9' 8 %-24 %: ' + % ="6 '! c'+! E Y ' % - !dK &2M9eU+H-+f "b5"U SgS :+HJ1= 8 %'T'-( &-' b %H% ' "=- % & %'' % EhSC 4 HC( %' *"U i+ % * %' " % & %'/' %- Rb 'A % 2E P=+-S% %'S"A 8 % %'S --' GV- 8 %'? % - % GS ' >'2 "R+ % 3% %'EjR^ % 3 %'%-b'2T I 13+-b'2- 9',+ 7+! !C E

ABSTRACT

kE l0E%mmon pTqUrstq_uRv>swCxzy:ts2q{F|Iq#}~?,*swC~U~#q#!wCi|wHT-%

&BC &

Categories and Subject Descriptors

c- !

)P=+ B

General Terms

9'S- %'2 %*)- % -2)!0B- %' % & %'b% %'

Keywords

=P +- %INTRODUCTION '0 8 - %5' 8 % 9CBC %'b % & %'b% %') 6E E) +-5% 'L "72 %- f 8 -H'+!- 5 "7.0213%2C )=13 %W0 %1 "$%A'+ %Cc) "#9+- 9 -'+ 93 &9-7"i+- % 3SCB) 8 - 8 "#+ % 9 )0- &3 &5"U 1$V :;: : ? >

> < )=13+-4ª C( ', 8 :+-V %'LC

8 H'-,)R13 x t· & !C "U ?K "#,NWIBT^C'- %Q "= ' % ) ?,^-'-G:', Q %:: % & %' & Je FiKfg,) 1=$CG- &J &F+!2WI/G,^-'-/+bI¤S R-\ ' % V %S+NI¤S R-\ % & %'$ &Je FKfg,) 8 -A% BTZ#`,/',( %X">+- JBC9 e Fg %5 0BoZ #`,=- % & %' & Je FiK g=13 %+5+-N b- ! +:%2 e : 5 8 g:+ V-Q"_ ,[ aA+ *e 1'K 2ge 1K gF $- %'-2 %f+H- Z¤) ¡C m2¡ 70£¡C)Fm2¢I0E n l21 .E Y -H-T ! Y E!³/!C 8 C 2Ej/- % & %' '-