Knowledge-based programs

Distributed Computing

Volumn 10, Issue 4, 1997, Pages 199-225

  Fagin, Ronald ^a   Halpern, Joseph Y ^b   Moses, Yoram ^c   Vardi, Moshe Y ^d  

^a IBM ALMADEN RESEARCH CENTER   (United States)

^b Center for Applied Mathematics   (United States)

^c WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^d Rice University   (United States)

Author keywords

Knowledge based program; Multi agent system; Protocol reasoning about knowledge

Indexed keywords

ARTIFICIAL INTELLIGENCE; DISTRIBUTED COMPUTER SYSTEMS; FINITE AUTOMATA; FORMAL LOGIC; NETWORK PROTOCOLS;

FINITE STATE CONTEXT; KNOWLEDGE BASED PROGRAMS;

KNOWLEDGE BASED SYSTEMS;

EID: 0031206975     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004460050038     Document Type: Article

References (39)

1. Abadi M, Lamport L: The existence of refinement mappings. Theor Comput Sci 82(2): 253-284 (1991)
2. Barwise J: Scenes and other situations. J Phil 78(7): 369-397 (1981)
3. Chandy KM, Misra J: Parallel program design: a foundation. Addison-Wesley, Reading. MA 1988
4. Choueka Y: Theories of automata on ω-tapes: a simplified approach. J Comput Syst Sci 8: 117-141 (1974)
5. Clarke EM, Emerson EA, Sistla AP: Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Trans Prog Lang Syst 8(2): 244-263 (1986) [An early version appeared in: Proc 10th ACM Symposium on Principles of Programming Languages (1983)]
6. Clarke EM, Emerson EA, Sistla AP: Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Trans Prog Lang Syst 8(2): 244-263 (1986) [An early version appeared in: Proc 10th ACM Symposium on Principles of Programming Languages (1983)]
7. Dwork C, Moses Y: Knowledge and common knowledge in a Byzantine environment: crash failures. Inform Comput 88(2): 156-186 (1990)
8. Fagin R, Halpern JY, Moses Y, Vardi MY: An operational semantics for knowledge bases. In: Proc National Conference on Artificial Intelligence (AAAI '94). pp 1142-1144 (1994)
9. Fagin R, Halpern JY, Moses Y, Vardi MY: Reasoning about knowledge. MIT Press, Cambridge, MA 1995
10. Fudenberg D, Tirole J: Game theory. MIT Press. Cambridge. MA 1991
11. Garey M, Johnson DS: Computers and intractability: A guide to the theory of NP-completeness. Freeman, San Francisco, CA 1979
12. Halpern JY, Fagin R: A formal model of knowledge, action, and communication in distributed systems: preliminary report. In: Proc 4th ACM Symp on Principles of Distributed Computing. pp 224-236 (1985)
13. Halpern JY, Fagin R: Modelling knowledge and action in distributed systems. Distrib Comput 3(4): 159-179 (1989). [A preliminary version appeared in: Proc 4th ACM Symposium on Principles of Distributed Computing (1985) with the title "A formal model of knowledge, action, and communication in distributed systems: preliminary report"]
14. Halpern JY, Fagin R: Modelling knowledge and action in distributed systems. Distrib Comput 3(4): 159-179 (1989). [A preliminary version appeared in: Proc 4th ACM Symposium on Principles of Distributed Computing (1985) with the title "A formal model of knowledge, action, and communication in distributed systems: preliminary report"]
15. Halpern JY, Moses Y: Knowledge and common knowledge in a distributed environment. J ACM 37(3): 549-587 (1990). [A preliminary version appeared in: Proc 3rd ACM Symposium on Principles of Distributed Computing (1984)]
16. Halpern JY, Moses Y: Knowledge and common knowledge in a distributed environment. J ACM 37(3): 549-587 (1990). [A preliminary version appeared in: Proc 3rd ACM Symposium on Principles of Distributed Computing (1984)]
17. Halpern JY, Moses Y: A guide to completeness and complexity for modal logics of knowledge and belief. Artif Intell 54: 319-379 (1992)
18. Halpern JY, Moses Y, Waarts O: A characterization of eventual Byzantine agreement. In: Proc 9th ACM Symp on Principles of Distributed Computing, pp 333-346 (1990)
19. Halpern JY, Zuck LD: A little knowledge goes a long way: knowledge-based derivations and correctness proofs for a family of protocols. J ACM 39(9): 449-478 (1992)
20. Jerrum MR, Valiant LG, Vazirani VV: Random generation of combinatorial structures from a uniform distribution. Theoret Comput Sci 43: 169-188 (1986)
21. Katz S, Taubenfeld G: What processes know: definitions and proof methods. In: Proc 5th ACM Symp on Principles of Distributed Computing, pp 249-262 (1986)
22. Kurki-Suonio R: Towards programming with knowledge expressions. In: Proc. 13th ACM Symp on Principles of Programming Languages, pp 140-149 (1986)
23. Manna Z, Pnueli A: The temporal logic of reactive and concurrent systems, vol 1. Springer. Berlin Heidelberg New York 1992
24. Mazer MS: Implementing distributed knowledge-based protocols. Submitted for publication (1991)
25. Moses Y: Resource-bound knowledge. In: Vardi MY (ed) Proc Second Conference on Theoretical Aspects of Reasoning about Knowledge, pp 261-276. Morgan Kaufmann. San Francisco. CA 1988
26. Moses Y, Kislev O: Knowledge-oriented programming. In: Proc 12th ACM Symp. on Principles of Distributed Computing. pp 261-270 (1993)
27. Moses Y, Tuttle MR: Programming simultaneous actions using common knowledge. Algorithmica 3: 121-169 (1988)
28. Neiger G: Knowledge consistency: a useful suspension of disbelief. In: Vardi MY (ed) Proc. Second Conference on Theoretical Aspects of Reasoning about Knowledge, pp 295-308. Morgan Kaufmann. San Francisco. CA 1988
29. Neiger G, Bazzi R: Using knowledge to optimally achieve coordination in distributed systems. In: Moses Y (ed) Theoretical aspects of reasoning about knowledge: Proc Fourth Conference, pp 43-59. Morgan Kaufmann. San Francisco, CA 1992
30. Neiger G, Toueg S: Simulating real-time clocks and common knowledge in distributed systems. J ACM 40(2): 334-367 (1993)
31. Owicki S, Lamport L: Proving livencss properties of concurrent programs. ACM Trans. Progr Lang Syst 4(3): 455-495 (1982)
32. Papadimitriou CH, Yanakakis M: The complexity of facets (and some facets of complexity). J Comput Syst Sci 28(2): 244-259 (1982)
33. Sanders B: A predicate transformer approach to knowledge and knowledge-based protocols. In: Proc 10th ACM Symp on Principles of Distributed Computing, pp 217-230 (1991). [A revised report appears as: ETH Informatik Technical Report 181 (1992)]
34. Sanders B: A predicate transformer approach to knowledge and knowledge-based protocols. In: Proc 10th ACM Symp on Principles of Distributed Computing, pp 217-230 (1991). [A revised report appears as: ETH Informatik Technical Report 181 (1992)]
35. Savitch WJ: Relationships between nondeterministic and deterministic tape complexities. J Comput Syst Sci 4: 177-192 (1970)
36. Shoham Y: Agent oriented programming. Artif Intell 60(1): 51-92 (1993)
37. Sistla AP, Clarke EM: The complexity of propositional linear temporal logics. J ACM 32(3): 733-749 (1985)
38. Vardi MY, Wolper P: An automata-theoretic approach to automatic program verification. In: Proc 1st IEEE Symp on Logic in Computer Science, pp 332-344 (1986)
39. Vardi MY, Wolper P: Reasoning about infinite computations. Inform Comput 115(1): 1-37 (1994)