Probabilistic algorithmic knowledge

Proceedings of the 9th Conference on Theoretical Aspects of Rationality and Knowledge, TARK 2003

Volumn , Issue , 2003, Pages 118-130

  Halpern, Joseph Y ^a   Pucella, Riccardo ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 56349087797     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/846241.846258     Document Type: Conference Paper

References (20)

1. Berman, P., J. Garay, and K. J. Perry (1989). Towards optimal distributed consensus. In Proc. 30th IEEE Symp. on Foundations of Computer Science, pp. 410-415.
2. Dolev, D. and A. C. Yao (1983). On the security of public key protocols. IEEE Transactions on Information Theory 29(2), 198-208.
3. Fagin, R. and J. Y. Halpem (1988). Belief, awareness, and limited reasoning. Artificial Intelligence 34, 39-76.
4. Fagin, R., J. Y. Halpern, Y. Moses, and M. Y. Vardi (1995). Reasoning about Knowledge. The MIT Press.
5. Halpern, J. Y. and R. Fagin (1992). Two views of belief: belief as generalized probability and belief as evidence. Artificial Intelligence 54, 275-317.
6. Halpern, J. Y., Y. Moses, and M. Y. Vardi (1994). Algorithmic knowledge. In Theoretical Aspects of Reasoning about Knowledge: Proc. Fifth Conference, pp. 255-266.
7. Halpern, J. Y. and R. Pucella (2002). Modeling adversaries in a logic for reasoning about security protocols. In Proceedings of FASec'02. Available as Royal Holloway Department of Computer Science Technical Report CSD-TR-02-13. To appear in LNCS.
8. Halpern, J. Y. and R. Pucella (2003). A logic for reasoning about evidence. To appear in Proceedings of the 19th Conference on Uncertainty in Artificial Intelligence (UAI'03).
9. Hintikka, J. (1962). Knowledge and Belief. Ithaca, N.Y.: Cornell University Press.
10. Kripke, S. (1963). A semantical analysis of modal logic I: normal modal prepositional calculi. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 9, 67-96.
11. Announced in Journal of Symbolic Logic 24, 1959, p. 323.
12. Kyburg, H. (1983). Recent work in inductive logic. In T. Machan and K. Lucey (eds.), Recent Work in Philosophy, pp. 87-150. Rowman & Allanheld.
13. Motwani, R. and P. Raghavan (1995). Randomized Algorithms. Cambridge University Press.
14. Paulson, L. C. (1998). The inductive approach to verifying cryptographic protocols. Journal of Computer Security 6(1/2), 85-128.
15. Rabin, M. O. (1980). Probabilistic algorithm for testing primality. Journal of Number Theory 12, 128-138.
16. Ramanujam, R. (1999). View-based explicit knowledge. Annals of Pure and Applied Logic 96(1-3), 343-368.
17. Rivest, R. L., A. Shamir, and L. Adelman (1978). A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM 21(2), 120-126.
18. Shafer, G. (1976). A Mathematical Theory of Evidence. Princeton University Press.
19. Shafer, G. (1982). Belief functions and parametric models (with commentary). Journal of the Royal Statistical Society, Series B 44, 322-352.
20. Walley, P. (1987). Belief function representations of statistical evidence. Annals of Statistics 18(4), 1439-1465.