Probabilistic algorithmic knowledge

Logical Methods in Computer Science

Volumn 1, Issue 3, 2005, Pages

  Halpern, Joseph Y ^a   Pucella, Riccardo ^b  

^a Department of Obstetrics Gynecology   (United States)

^b NORTHEASTERN UNIVERSITY   (United States)

Author keywords

Algorithmic knowledge; Evidence; Knowledge; Logic; Probability; Randomized algorithms

Indexed keywords

COMPUTERS; PROBABILITY;

ALGORITHMIC KNOWLEDGE; EVIDENCE; KNOWLEDGE; LOGIC; RANDOMIZED ALGORITHMS;

COMPUTER SCIENCE;

EID: 84887494392     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-1(3:1)2005     Document Type: Article

References (22)

1. Berman, P., J. Garay, and K. J. Perry (1989). Towards optimal distributed consensus. In Proc. 30th IEEE Symposium on the Foundations of Computer Science (FOCS’89), 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. Halpern (1988). Belief, awareness, and limited reasoning. Artificial Intelligence 34, 39-76.
4. Fagin, R., J. Y. Halpern, and N. Megiddo (1990). A logic for reasoning about probabilities. Information and Computation 87(1/2), 78-128.
5. Fagin, R., J. Y. Halpern, Y. Moses, and M. Y. Vardi (1995). Reasoning about Knowledge. MIT Press.
6. Halpern, J. Y. (2003). Reasoning About Uncertainty. MIT Press.
7. Halpern, J. Y. and R. Fagin (1992). Two views of belief: belief as generalized probability and belief as evidence. Artificial Intelligence 54, 275-317.
8. Halpern, J. Y., Y. Moses, and M. Y. Vardi (1994). Algorithmic knowledge. In Proc. 5th Conference on Theoretical Aspects of Reasoning about Knowledge (TARK’94), pp. 255-266.
9. Halpern, J. Y. and R. Pucella (2002). Modeling adversaries in a logic for reasoning about security protocols. In Proc. Workshop on Formal Aspects of Security (FASec’02), Volume 2629 of Lecture Notes in Computer Science, pp. 115-132.
10. Halpern, J. Y. and R. Pucella (2003). A logic for reasoning about evidence. In Proc. 19th Conference on Uncertainty in Artificial Intelligence (UAI’03), pp. 297-304.
11. Hintikka, J. (1962). Knowledge and Belief. Cornell University Press.
12. Hintikka, J. (1975). Impossible possible worlds vindicated. Journal of Philosophical Logic 4, 475-484.
13. Kozen, D. (1985). A probabilistic PDL. Journal of Computer and Systems Sciences 30(2), 162-178.
14. Kripke, S. (1963). A semantical analysis of modal logic I: normal modal propositional calculi. Zeitschrift f¨ur Mathematische Logik und Grundlagen der Mathematik 9, 67-96.
15. Kyburg, Jr., H. E. (1983). Recent work in inductive logic. In T. Machan and K. Lucey (Eds.), Recent Work in Philosophy, pp. 87-150. Rowman & Allanheld.
16. Motwani, R. and P. Raghavan (1995). Randomized Algorithms. Cambridge University Press.
17. Paulson, L. C. (1998). The inductive approach to verifying cryptographic protocols. Journal of Computer Security 6(1/2), 85-128.
18. Rabin, M. O. (1980). Probabilistic algorithm for testing primality. Journal of Number Theory 12, 128-138.
19. Ramanujam, R. (1999). View-based explicit knowledge. Annals of Pure and Applied Logic 96(1-3), 343-368.
20. 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.
21. Shafer, G. (1982). Belief functions and parametric models (with commentary). Journal of the Royal Statistical Society, Series B 44, 322-352.
22. Walley, P. (1987). Belief function representations of statistical evidence. Annals of Statistics 18(4), 1439-1465.