×

Public announcement logic with distributed knowledge. (English) Zbl 1298.03061

van Ditmarsch, Hans (ed.) et al., Logic, rationality, and interaction. Third international workshop, LORI 2011, Guangzhou, China, October 10–13, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-24129-1/pbk). Lecture Notes in Computer Science 6953. Lecture Notes in Artificial Intelligence, 328-341 (2011).
Summary: While dynamic epistemic logics with common knowledge have been extensively studied, dynamic epistemic logics with distributed knowledge have so far received far less attention. In this paper we study extensions of public announcement logic (PAL) with distributed knowledge, in particular their expressivity and axiomatisations. PAL extended only with distributed knowledge is not more expressive than standard epistemic logic with distributed knowledge. Our focus is therefore on PACD, the result of adding both common and distributed knowledge to PAL, which is more expressive than each of its component logics. Our main result is a completeness result for PACD. The axiomatisation is not surprising: it is the combination of well-known axioms. The completeness proof, however, is not trivial, and requires novel combinations and extensions of techniques for dealing with S5 knowledge, distributed knowledge, common knowledge and public announcements at the same time.
See also the authors’ paper [Synthese 190, Suppl. 1, 135–162 (2013; doi:10.1007/s11229-012-0243-3)].
For the entire collection see [Zbl 1223.68013].

MSC:

03B42 Logics of knowledge and belief (including belief change)
68T27 Logic in artificial intelligence
Full Text: DOI

References:

[1] Baltag, A., Moss, L.: Logics for epistemic programs. Synthese 139, 165–224 (2004) · Zbl 1100.03010 · doi:10.1023/B:SYNT.0000024912.56773.5e
[2] Baltag, A., Moss, L., Solecki, S.: The logic of public announcements, common knowledge, and private suspicions. In: Proc. of TARK VII, pp. 43–56 (1998) · Zbl 1386.03019
[3] van Benthem, J.: Open problems in logical dynamics. In: Math. Problems from Applied Logic I: Logics for the XXIst Century. Int. Math. Series, vol. 4, pp. 137–192. Springer, Heidelberg (2006) · doi:10.1007/0-387-31072-X_3
[4] van Ditmarsch, H., van der Hoek, W., Kooi, B.: Dynamic Epistemic Logic. Springer, Heidelberg (2007) · Zbl 1156.03015 · doi:10.1007/978-1-4020-5839-4
[5] Fagin, R., Halpern, J., Moses, Y., Vardi, M.: Reasoning about Knowledge. MIT Press, Cambridge (1995) · Zbl 0839.68095
[6] Fagin, R., Halpern, J., Vardi, M.: What can machines know? On the properties of knowledge in distributed systems. Journal of the ACM 39(2), 328–376 (1992) · Zbl 0799.68179 · doi:10.1145/128749.150945
[7] Gerbrandy, J.: Bisimulations on Planet Kripke. Ph.D. thesis, ILLC (1999)
[8] Halpern, J., Moses, Y.: A guide to completeness and complexity for modal logics of knowledge and belief. Artif. Intell. 54(3), 319–379 (1992) · Zbl 0762.68029 · doi:10.1016/0004-3702(92)90049-4
[9] van der Hoek, W., Meyer, J.J.: Making some issues of implicit knowledge explicit. International Journal of Foundations of Computer Science 3(2), 193–224 (1992) · Zbl 0759.68082 · doi:10.1142/S0129054192000139
[10] van der Hoek, W., Meyer, J.J.: A complete epistemic logic for multiple agents: Combining distributed and common knowledge. In: Bacharach, M., Gerard-Varet, L., Mongin, P., Shin, H. (eds.) Epistemic Logic and the Theory of Games and Decisions, pp. 35–68. Kluwer, Dordrecht (1997) · Zbl 0956.03022 · doi:10.1007/978-1-4613-1139-3_2
[11] Meyer, J.J., van der Hoek, W.: Epistemic Logic for AI and Computer Science, vol. 41. Cambridge University Press, Cambridge (1995) · Zbl 0868.03001 · doi:10.1017/CBO9780511569852
[12] Plaza, J.: Logics of public communications. In: Proc. of ISMIS, pp. 201–216 (1989)
[13] Roelofsen, F.: Distributed knowledge. J. of Applied Non-Classical Logics 16 (2006) · Zbl 1186.03032
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.