摘要: We study a generalization of the Muddy Children puzzle by allowing public announcements with arbitrary generalized quantifiers. propose new concise logical modeling based on number triangle representation Our general aim is to discuss possibility epistemic that cut for specific informational dynamics. Moreover, we show solvable any agents if and only quantifier in announcement positively active (satisfies form variety).
acm.org
core.ac.uk
philpapers.org
narcis.nl参考文章(19)
Rohit Parikh, Finite and Infinite Dialogues Mathematical Sciences Research Institute Publications. pp. 481- 497 ,(1992) , 10.1007/978-1-4612-2822-6_18
John Edensor Littlewood, A mathematician's miscellany ,(1953)
Johan van Benthem, Logical Dynamics of Information and Interaction: Questions and issue management ,(2011) , 10.1017/CBO9780511974533.007
Ron van der Meyden, Finite State Implementations of Knowledge-Based Programs foundations of software technology and theoretical computer science. pp. 262- 273 ,(1996) , 10.1007/3-540-62034-6_55
J.D. Gerbrandy, Bisimulations on Planet Kripke ILLC Dissertation Series. ,(1999)
Patrice Godefroid, Michael Huth, Radha Jagadeesan, Abstraction-Based Model Checking Using Modal Transition Systems international conference on concurrency theory. pp. 426- 440 ,(2001) , 10.1007/3-540-44685-0_29
Dag Westerståhl, Stanley Peters, Quantifiers in Language and Logic ,(2006)
J.F.A.K. van Benthem, Essays in Logical Semantics ,(2011)
Rineke Verbrugge, Logic and Social Cognition Journal of Philosophical Logic. ,vol. 38, pp. 649- 680 ,(2009) , 10.1007/S10992-009-9115-9
Alessio Lomuscio, Mika Cohen, Hongyang Qu, Mads Dam, A symmetry reduction technique for model checking temporal-epistemic logic international joint conference on artificial intelligence. pp. 721- 726 ,(2009) , 10.1007/978-3-642-04761-9