u C. Papers in Journals


next up previous
Next: D. Papers in Conference Proceedings Up: Publications Previous: B. Articles in Books

C. Papers in Journals

  1. Axiomatic definitions of programming languages: a theoretical assessment, Journal of the ACM 29:2, April, 1982, pp. 555-576 (with A. R. Meyer).

  2. Deterministic propositional dynamic logic: finite models, complexity, and completeness, Journal of Computer and Systems Science 25:3, 1982, pp. 402-417 (with M. Ben-Ari and A. Pnueli).

  3. The propositional dynamic logic of deterministic, well-structured programs, Theoretical Computer Science 27, 1983, pp. 127-165 (with J. H. Reif).

  4. Effective axiomatizations of Hoare Logics, Journal of the ACM 30:3, 1983, pp. 612-637 (with E. M. Clarke and S. M. German).

  5. Deterministic process logic is elementary, Information and Control 57:1, 1983, pp. 56-89.

  6. Decision procedures and expressiveness in the temporal logic of branching time, Journal of Computer and Systems Science 30:1, 1985, pp. 1-24 (with E. A. Emerson).

  7. Optimal precision in the presence of uncertainty, Journal of Complexity 1, 1985, pp. 170-196 (with N. Megiddo and A. Munshi).

  8. Equations between regular terms and an application to process logic, SIAM J. Computing 14:4, 1985, pp. 935-942 (with A. Chandra, A. R. Meyer, and R. Parikh).

  9. ``Sometimes'' and ``not never'' revisited: on branching vs. linear time, Journal of the ACM 33:1, 1986, pp. 151-178 (with E. A. Emerson).

  10. On time versus space III, Math. Systems Theory 19, 1986, pp. 13-28 (with M. C. Loui, A. R. Meyer, and D. Weise).

  11. On the possibility and impossibility of achieving clock synchronization, Journal of Computer and Systems Science 32:2, 1986, pp. 230-250, (with D. Dolev and H. R. Strong).

  12. Cheating husbands and other stories: a case study in knowledge, action, and communication, Distributed Computing 1:3, 1986, pp. 167-176 (with D. Dolev and Y. Moses).

  13. Taken by surprise: the paradox of the surprise test revisited, Journal of Phosophical Logic 15:3, 1986, pp. 281-304 (with Y. Moses).

  14. A new look at fault-tolerant network routing, Information and Computation 72:3, 1987, pp. 180-196 (with D. Dolev, B. Simons, and H. R. Strong).

  15. A logic to reason about likelihood, Artificial Intelligence 32:3, 1987, pp. 379-405 (with M. O. Rabin).

  16. Belief, awareness, and limited reasoning, Artificial Intelligence 34, 1988, pp. 39-76 (with R. Fagin).

  17. I'm OK if you're OK: On the notion of trusting communication, Journal of Philosophical Logic 17:4, 1988, pp. 329-354 (with R. Fagin).

  18. The complexity of reasoning about knowledge and time, I: lower bounds, Journal of Computer and Systems Science 38:1, 1989, pp. 195-237 (with M. Y. Vardi).

  19. Likelihood, probability, and knowledge, Computational Intelligence 5, pp. 151-160, 198 9 (with D. A. McAllester).

  20. Reasoning about procedures as parameters in the language L4, Information and Computation 83:3, 1989, pp. 265-359 (the whole volume) (with S. M. German and E. M. Clarke).

  21. Modelling knowledge and action in distributed systems, Distributed Computing 3:4, 1989, pp. 159-177 (with R. Fagin).

  22. Completeness of rewrite rules and rewrite strategies for FP, Journal of the ACM 37:1, 1990, pp. 86-143 (with J. H. Williams and E. L. Wimmers).

  23. Knowledge and common knowledge in a distributed environment, Journal of the ACM 37:3, 1990, pp. 549-587 (with Y. Moses).

  24. A logic for reasoning about probabilities, Information and Computation 87:1,2, 1990, pp. 78-128 (with R. Fagin and N. Megiddo)

  25. An analysis of first-order logics of probability, Artificial Intelligence 46, 1990, pp. 311-350.

  26. Presburger arithmetic with unary predicates is complete, Journal of Symbolic Logic 56:2, 1991, pp. 637-642.

  27. The relationship between knowledge, belief, and certainty, Annals of Mathematics and Artificial Intelligence 4, 1991, pp. 301-322.

  28. A model-theoretic analysis of knowledge, Journal of the ACM 38:2, 1991, pp. 382-428 (with R. Fagin and M. Y. Vardi).

  29. A propositional modal interval logic, Journal of the ACM 38:4, 1991, pp. 935-962 (with Y. Shoham).

  30. Clock synchronization and the power of broadcasting, Distributed Computing 5:2, 1991, pp. 73-83 (with I. Suzuki).

  31. Uncertainty, belief, and probability, Computational Intelligence 7, 1991, pp. 160-173 (with R. Fagin).

  32. What can machines know? On the properties of knowledge in distributed systems, Journal of the ACM 39:2, 1992, pp. 328-376 (with R. Fagin and M. Y. Vardi).

  33. Two views of belief: belief as generalized probability and belief as evidence, Artificial Intelligence 54, 1992, pp. 275-317 (with R. Fagin).

  34. A guide to completeness and complexity for modal logics of knowledge and belief, Artificial Intelligence 54, 1992, pp. 319-379 (with Y. Moses).

  35. A little knowledge goes a long way: knowledge-based derivations and correctness proofs for a family of protocols, Journal of the ACM 39:3, 1992, pp. 449-478 (with L. Zuck).

  36. What is an inference rule?, Journal of Symbolic Logic 57:3, 1992, pp. 1018-1045 (with R. Fagin and M. Y. Vardi).

  37. Message-optimal protocols for Byzantine agreement, Mathematical Systems Theory 26, 1993, pp. 41-102 (with V. Hadzilacos).

  38. The failure discovery problem, Mathematical Systems Theory 26, 1993, pp. 103-129 (with V. Hadzilacos).

  39. Knowledge, probability, and adversaries, Journal of the ACM 40:4, pp. 917-962, 1993 (with M. Tuttle).

  40. Naming and identity in epistemic logics, I: The propositional case, Journal of Logic and Computation 3:4, 1993, pp. 345-378 (with A. J. Grove).

  41. Reasoning about knowledge and probability, Journal of the ACM 41:2, 1994, pp. 340-367 (with R. Fagin).

  42. Decidability and expressiveness for first-order logics of probability, Information and Computation 112:1, 1994, pp. 1-36 (with M. Abadi).

  43. Random worlds and maximum entropy, Journal of AI Research 2, 1994, pp. 33-88 (with A. J. Grove and D. Koller).

  44. Zero-one laws for modal logic, Annals of Pure and Applied Logic 69, 1994, pp. 157-193 (with B. M. Kapron).

  45. Full abstraction and expressive completeness for FP, Information and Computation 118:2, 1995, pp. 246-271 (with E. L. Wimmers).

  46. Dynamic fault-tolerant clock synchronization, Journal of the ACM 42:1, 1995, pp. 143-185 (with B. Simons, H. R. Strong, and D. Dolev).

  47. The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic, Artificial Intelligence 75:2, 1995, pp. 361-372.

  48. Levesque's axiomatization of only knowing is incomplete, Artificial Intelligence 74:2, 1995, pp. 381-387 (with G. Lakemeyer).

  49. A nonstandard approach to the logical omniscience problem, Artificial Intelligence, 79:2, 1995, pp. 203-240 (with R. Fagin and M. Y. Vardi).

  50. Asymptotic conditional probabilities: the unary case, SIAM Journal on Computing, 25:1, 1996, pp. 1-51, (with A. J. Grove and D. Koller).

  51. Asymptotic conditional probabilities: the non-unary case, Journal of Symbolic Logic 61:1, 1996, pp. 250-275 (with A. J. Grove and D. Koller).

  52. Should knowledge entail belief?, Journal of Philosophical Logic 25:5, 1996, pp. 483-494.

  53. From statistical knowledge bases to degrees of belief, Artificial Intelligence 87:1-2, 1996, pp. 75-143 (with F. Bacchus, A. J. Grove, and D. Koller).

  54. A theory of knowledge and ignorance for many agents, Journal of Logic and Computation 7:1, 1997, pp. 79-108.

  55. A critical reexamination of default logic, autoepistemic logic, and only knowing, Computational Intelligence 13:1, 1997, pp. 144-163.

  56. On ambiguities in the interpretation of game trees, Games and Economic Behavior 20, 1997, pp. 66-96.

  57. On the expected value of games with absentmindedness, Games and Economic Behavior 20, 1997, pp. 51-65 (with A. Grove).

  58. Knowledge-based programs, Distributed Computing 10:4, 1997, pp. 199-225 (with R. Fagin, Y. Moses, and M. Y. Vardi).

  59. Modeling belief in dynamic systems. Part I: Foundations, Artificial Intelligence 95:2, 1997, pp. 257-316 (with N. Friedman).

  60. Defining relative likelihood in partially-ordered preferential structures, Journal of AI Research 7, 1997, pp. 1-24.

  61. Performing work efficiently in the presence of faults, SIAM Journal on Computing 27:5, 1998 (with C. Dwork and O. Waarts).

  62. On the knowledge requirements for tasks, Artificial Intelligence 98:1-2, 1998, pp. 317-349 (with R. Brafman and Y. Shoham).

  63. Modeling belief in dynamic systems. Part II: Revision and Update, Journal of AI Research 10, 1999, pp. 117-167 (with N. Friedman).

  64. Common knowledge revisited, Annals of Pure and Applied Logic 96, 1999, pp. 89-105 (with R. Fagin, Y. Moses, and M. Y. Vardi).

  65. Hypothetical knowledge and counterfactual reasoning, International Journal of Game Theory 28:3, 1999, pp. 315-330.

  66. The hierarchical approach to modeling knowledge and common knowledge, International Journal of Game Theory 28:3, 1999, pp. 331-365 (with R. Fagin, J. Geanakoplos, and M. Y. Vardi).

  67. Set-theoretic completeness for epistemic and conditional logic Annals of Mathematics and Artificial Intelligence 26, 1999, pp. 1-27.

  68. A counterexample to theorems of Cox and Fine, Journal of AI Research, 10, 1999, pp. 67-85.

  69. Belief revision: a critique, Journal of Logic, Language, and Information 8, 1999, pp. 401-420 (with N. Friedman).

  70. Cox's Theorem revisited, Journal of AI Research 11, 1999, pp. 429-435.

  71. Reasoning about noisy sensors in the situation calculus, Artificial Intelligence, 1999, pp. 131-169 (with F. Bacchus and H. J. Levesque).

  72. Axiomatizing causal reasoning, Journal of AI Research 12, 2000, pp. 317-337.

  73. A note on knowledge-based programs and specifications, Distributed Computing, 13:3, 2000, pp. 145-153.

  74. First-order conditional logic for default reasoning revisited, ACM Transactions on Computational Logic 1:2, 2000, pp. 175-207 (with N. Friedman and D. Koller).

  75. Multi-agent only knowing, Journal of Logic and Computation 11:1, 2001, pp. 41-70 (with G. Lakemeyer).

  76. A logic for SDSI's linked local named spaces, Journal of Computer Security, 9:1,2, 2001, pp. 47-74 (with R. van der Meyden).

  77. Alternative semantics for unawareness, Games and Economic Behavior 37, 2001, pp. 321-339.

  78. Substantive rationality and backward induction Games and Economic Behavior 37, 2001, pp. 425-435.

  79. A decision-theoretic approach to reliable message delivery, Distributed Computing 14, 2001, pp. 1-16 (with F. Chu).

  80. Conditional plausibility measures and Bayesian networks, Journal of AI Research 14, 2001, pp. 359-389.

  81. On the NP-Completeness of finding an optimal strategy in games with common payoffs, 2001, International Journal of Game Thoery 30:1, 2001, pp. 99-106 (with F. Chu).

  82. Plausibility measures and default reasoning, Journal of the ACM 48:4, 2001, pp. 648-685 (with N. Friedman).

  83. A characterization of eventual Byzantine agreement, SIAM Journal on Computing 31:3, 2001, pp. 838-865 (with Y. Moses and O. Waarts).

  84. Characterizing the common prior assumption, Journal of Economic Theory, 106:2, 2002, pp. 316--355.

  85. A logic for reasoning about upper probabilities, Journal of AI Research 17, pp. 57-81, 2002 (with R. Pucella).

  86. A computer scientist looks at game theory, Games and Economic Behavior 45:1, 2003, pp. 114-131.

  87. A logical reconstruction of SPKI, Journal of Computer Security 11:4, 2003, pp. 581--614 (with R. van der Meyden).

  88. On the relationship between strand spaces and multi-agent systems, ACM Transactions on Information and System Security 6:1, 2003, pp. 43-70 (with R. Pucella).

  89. Updating probabilities, Journal of AI Research 19, 2003 (with P. Grunwald).

  90. Complete axiomatizations for reasoning about knowledge and time, SIAM Journal on Computing 33:2, 2004, pp. 674-703 (with R. van der Meyden and M. Vardi).

  91. A minimum-energy path-preserving topology-control algorithm, IEEE Transactions on Wireless Communications 3:3, 2004, pp. 910-921 (with L. Li).

  92. Representation dependence in probabilistic inference, Journal of AI Research 21, pp. 319-356, 2004 (with D. Koller).

  93. Reasoning about common knowledge with infinitely many agents, Information and Computation 191:1, 2004, pp.1-40 (with R. Shore).

  94. Using counterfactuals in knowledge-based programming, Distributed Computing 17:2, 2004, pp. 91-106 (with Y. Moses).

  95. Great expectations. Part II: Generalized expected utility as a universal decision rule, Artificial Intelligence 159:1,2, 2004, pp. 207-230 (with F. Chu).

  96. Responsibility and blame: A structural-model approach, Journal of AI Research 22, 2004, pp. 93--115 (with H. Chockler).

  97. Causes and explanations: A structural-model approach-Part I: Causes, British Journal for the Philosophy of Science 56:4,2005, pp. 843-887(with J. Pearl).

  98. Causes and explanations: A structural-model approach-Part II: Explanation, British Journal for the Philosophy of Science 56:4, 2005, pp. 889-911 (with J. Pearl).

  99. A cone-based distributed topology-control algorithm for wireless multi-hop networks, IEEE/ACM Transactions on Networks 13:1, 2005, pp. 147-159 (with L. Li, M. Bahl, Y. Wang, R. Wattenhofer).

  100. A knowledge-theoretic analysis of uniform distributed coordination and failure detectors, Distributed Computing 17:3, 2005, pp. 223-236 (with A. Ricciardi).

  101. Anonymity and information hiding in multiagent systems, Journal of Computer Security 13:3, 2005, pp. 483-514 (with K. O'Neill).

  102. Probabilistic algorithmic knowledge, Logical Methods in Computer Science 1:3, 2005 (with R. Pucella).

  103. A logic for reasoning about evidence, Journal of AI Research 26, 2006, pp. 1-34 (with R. Pucella).

  104. Great expectations. Part I: On the customizability of generalized expected utility, Theory and Decision, 2006, to appear (with F. Chu).

  105. Gossip-based ad hoc routing, IEEE/ACM Transactions on Networking 14:3, 2006, pp. 479-491 (with Z. Haas and L. Li).

  106. Characterizing and reasoning about probabilistic and non-probabilistic expectation, Journal of the ACM 54:3, 2007 (with R. Pucella).

  107. What causes a system to satisfy a specification?, ACM Transactions on Computational Logic, to appear, 2007 (with H. Chockler and O. Kupferman).

  108. Characterizing the NP-PSPACE gap in the satisfiability problem for modal logic, Journal of Logic and Computation 17:4, pp. 795-806, 2007 (with L. Rego).

  109. Interactive awareness revisited, Games and Economic Behavior 62:1, 2008, pp. 232-262 (with L. Rego)

  110. What causes a system to satisfy a specification?, ACM Transactions on Computational Logic 9:3, 2008 (with H. Chockler and O. Kupferman).

  111. A formal foundation for XrML, Journal of the ACM 55:1, 2008 (with V. Weissman).

  112. Using first-order logic to reason about policies, ACM Transactions on Information and System Security 11:4, 2008 (with V. Weissman).

  113. Secrecy in multi-agent systems, ACM Transactions on Information and System Security 12:1, 2008, (with K. O'Neill).

  114. A nonstandard characterization of sequential equilibrium, perfect equilibrium, and proper equilibrium, International Journal of Game Theory 3838:1, 2009, pp. 37-50.

  115. Intransitivity and vagueness, Review of Symbolic Logic 1:4, 2009, pp. 530-547.

  116. Reasoning about knowledge of unawareness, Games and Economic Behavior, to appear, 2009 (with L. Rego).

  117. Lexicographic probability, conditional probability, and nonstandard probability, Games and Economic Behavior, to appear, 2009.

  118. On Definability in Multimodal Logic, to appear, Review of Symbolic Logic, (with D. Samet and E. Segev).

  119. Defining knowledge in terms of belief: the modal logic perspective, to appear, Review of Symbolic Logic (with D. Samet and E. Segev).

  120. Evidence with uncertain likelihoods, Synthese, to appear, 2009 (with R. Pucella).


next up previous
Next: D. Papers in Conference Proceedings Up: Publications Previous: B. Articles in Books


Joe Halpern
June 2009