Knowledge in Multiagent Systems: Initial Configurations and Broadcast

ACM Transactions on Computational Logic

Volumn 1, Issue 2, 2000, Pages 247-284

  Lomuscio, Alessio R ^a   Meyden Van Der, Ron ^b   Ryan, Mark ^c  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

^c UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

Completeness; Computational complexity; Knowledge Representation in Distributed Systems; Modal Logic

Indexed keywords

EID: 0038135545     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/359496.359527     Document Type: Article

References (43)

1. Aumann, R. J. 1976. Agreeing to disagree. Annals of Statistics 4, 6, 1236-1239.
2. Bergmann, G. 1949. The finite representations of S5. Methodos 1, 217-219.
3. Catach, L. 1988. Normal multimodal logics. In T. M. Smith and G. R. Mitchell Ed., Proceedings of the 7th National Conference on Artificial Intelligence (AAAI'88) (St. Paul, MN, Aug. 1988), pp. 491-495. Morgan Kaufmann.
4. Chellas, B. 1980. Modal Logic. Cambridge University Press, Cambridge.
5. Dwork, C. and Moses, Y. 1990. Knowledge and common knowledge in a byzantine environment. Information and Computation 88, 2, 156-186.
6. Fagin, R. and Vardi, M. Y. 1986. Knowledge and implicit knowledge in a distributed environment: Preliminary report. In J. Y. Halpern Ed., TARK: Theoretical Aspects of Reasoning about Knowledge (San Francisco (CA), 1986), pp. 187-206. Morgan Kaufmann.
7. Fagin, R., Halpern, J. Y., Moses, Y., and Vardi, M. Y. 1995. Reasoning about Knowledge. MIT Press, Cambridge.
8. Fagin, R., Halpern, J. Y., Moses, Y., and Vardi, M. Y. 1997. Knowledge-based programs. Distributed Computing 10, 4, 199-225.
9. Fagin, R., Halpern, J. Y., and Vardi, M. Y. 1992. What can machines know? On the properties of knowledge in distributed systems. Journal of the ACM 39, 2 (April), 328-376.
10. Fine, K. and Schurz, G. 1996. Transfer theorems for stratified multimodal logics. In J. Copeland Ed., Logic and Reality, Essays in Pure and Applied Logic. In memory of Arthur Prior, pp. 169-213. Oxford University Press.
11. Finger, M. and Gabbay, D. M. 1992. Adding a temporal dimension to a logic. Journal of Logic, Language and Information 1, 203-233.
12. Gabbay, D. 1998. Fibring Logics. Oxford University Press.
13. Gabbay, D. and Shehtman, V. 1998. Products of modal logics, part 1. Logic Journal of the IGPL 6, 1, 73-146.
14. Goldblatt, R. 1992. Logics of Time and Computation, Second Edition, Revised and Expanded, Volume 7 of CSLI Lecture Notes. CSLI, Stanford. Distributed by University of Chicago Press.
15. Halpern, J. and Moses, Y. 1990. Knowledge and common knowledge in a distributed environment. Journal of the ACM 37, 3, 549-587.
16. A preliminary version appeared in Proc. 3rd ACM Symposium on Principles of Distributed Computing, 1984.
17. Halpern, J. and Moses, Y. 1992. A guide to completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence 54, 319-379.
18. Halpern, J., van der Meyden, R., and Vardi, M. Y. 1997. Complete axiomatizations for reasoning about knowledge and time. Submitted.
19. Halpern, J., Moses, Y., and Waarts, O. 1990. A characterization of eventual Byzantine agreement. In Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing (Quebec City, Quebec, Canada, 22-24 Aug. 1990), pp. 333-346.
20. Hughes, G. E. and Cresswell, M. J. 1984. A Companion to Modal Logic. Methuen, London.
21. Hughes, G. E. and Cresswell, M. J. 1996. A New Introduction to Modal Logic. Routledge, New York.
22. Johnson, J. S. 1969. Nonfinitizability of classes of representable polyadic algebras. Journal of Symbolic Logic 34, 344-352.
23. Kracht, M. and Wolter, F. 1991. Properties of independently axiomatizable bimodal logics. Journal of Symbolic Logic 56, 4, 1469-1485.
24. Kurucz, A. 2000. On axiomatising products of kripke frames. The Journal of Symbolic Logic. To appear.
25. Ladner, R. E. and Reif, J. H. 1977. The computational complexity of provability in systems of modal propositional logic. SIAM Journal on Computing 6, 3, 467-480.
26. Lang, S. 1984. Algebra (2 ed.). Addison-Wesley, Reading.
27. Lemmon, E. J. 1977. The “Lemmon Notes”: An Introduction to Modal Logic. Basil Blackwell, Oxford. Written in collaboration with D. Scott; edited by K. Segerberg. American Philosophical Quarterly Monograph Series. Monograph No. 11.
28. Lomuscio, A. 1999. Knowledge Sharing among Ideal Agents. Ph.D. thesis, School of Computer Science, University of Birmingham, Birmingham, UK.
29. Lomuscio, A. and Ryan, M. 2000. A spectrum of modes of knowledge sharing between agents. In M. J. Wooldridge and N. R. Jennings Eds., Intelligent Agents VI-Proceedings of the Sixth International Workshop on Agent Theories, Architectures, and Languages (ATAL-99), Volume 1757 of Lecture Notes in Artificial Intelligence. Springer-Verlag, Heidelberg.
30. Lynch, N. 1996. Distributed Algorithms. Morgan Kaufmann, San Fancisco.
31. Marx, M. 1999. Complexity of products of modal logics. Journal of Logic and Computation 9, 2, 221-238.
32. McCarthy, J. 1989. Artificial intelligence, logic and formalizing common sense. In R. Thomason Ed., Philosophical Logic and Artificial Intelligence. Kluwer Academic.
33. McKinsey, J. 1941. A solution of the decision problem for the Lewis systems S2 and S4 with an application to topology. The Journal of Symbolic Logic 6, 117-134.
34. van der Meyden, R. 1996a. Knowledge based programs: On the complexity of perfect recall in finite environments. In Y. Shoham Ed., Proceedings of the Sixth Conference on Theoretical Aspects of Rationality and Knowledge (San Francisco, March 1996), pp. 31-50. Morgan Kaufmann Publishers.
35. van der Meyden, R. 1996b. Finite state implementations of knowledge-based programs. In Proceedings of the Conference on Foundations of Software Technology and Theoretical Computer Science, Volume 1180 of Lecture Notes in Computer Science (Hyderabad, India, Dec. 1996), pp. 262-273.
36. van der Meyden, R. 1998. Common knowledge and update in finite environments. Information and Computation 140, 2 (1 Feb.), 115-157.
37. Meyer, J.-J.C. and Hoek, W. 1995. Epistemic Logic for AI and Computer Science, Volume 41 of Cambridge Tracts in Theoretical Computer Science. Cambdridge University Press.
38. Moses, Y. and Tuttle, M. R. 1988. Programming simultaneous actions using common knowledge. Algorithmica 3, 121-169.
39. Moses, Y., Dolev, D., and Halpern, J. 1986. Cheating husbands and other stories: A case study of knowledge, action, and communication. Distributed Computing 1, 3, 167-176.
40. Nii, H. P. 1986. Blackboard systems (part one): the blackboard model of problem solving and the evolution of blackboard architectures. The AI Magazine Summer, 38-53.
41. Popkorn, S. 1994. First Steps in Modal Logic. Cambridge University Press: Cambridge, England.
42. Rubenstein, A. and Wolinsky, A. 1990. On the logic of ‘agreeing to disagree’ type results. Journal of Economic Theory 51, 184-193.
43. Venema, Y. 1995. Cylindric modal logic. Journal of Symbolic Logic 60, 2, 591-623.