The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Reasoning about knowledge and probability
Open accessAbstract
IBM AInuzdetz Resecrrcb Center, SCZnJo.w,Cul[fomia Abstroct.We provide a model for rcusonmg about knowledge and prob~bility together, We allow explicit mention of probabilities in formulas, so that our kmguagc has formu]as that essentially say "according to agent ~, formula p holds with probabi]lty at least b " The langutigc IS powerful enough to allow rewoning about higher-order proixibdities, as well w ti]lowing e~pliclt comparisons of the probabilities an agent places on distinct events.We present a general framcw(>rk for interpreting such formulas, and consider wmous properties that might hold of the interrclatmnship between agents' probability assignments at different states.We pro~,icte a complete axlomatization for reasoning about knowledge and probabihty, prove a small model property, and obtain decision procedures, We then consider the effects of adding common knowledge and a probabilistic variant of common knowledge to the language.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Mathematical Theory of Evidence
Shafer, G. (2020) · Princeton University Press eBooks · doi:10.2307/j.ctv10vm1qb · Cited by 11,711
The knowledge complexity of interactive proof systems
Goldwasser, S., Micali, S., & Rackoff, C. (1989) · SIAM Journal on Computing · doi:10.1137/0218012 · Cited by 3,285
An Introduction to Probability Theory and Its Applications
Feller, W., & Morse, P. M. (1958) · Physics Today · doi:10.1063/1.3062516 · Cited by 2,040
Aumann, R. J. (1976) · The Annals of Statistics · doi:10.1214/aos/1176343654 · Cited by 1,573
Hintikka, J. (1962) · Cited by 1,536
The knowledge complexity of interactive proof-systems
Goldwasser, S., Micali, S., & Rackoff, C. (1985) · Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85 · doi:10.1145/22145.22178 · Cited by 1,302
Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi
Kripke, S. A. (1963) · Mathematical Logic Quarterly · doi:10.1002/malq.19630090502 · Cited by 1,287
Nilsson, N. J. (1986) · Artificial Intelligence · doi:10.1016/0004-3702(86)90031-7 · Cited by 1,223
Knowledge and common knowledge in a distributed environment
Halpern, J. Y., & Moses, Y. (1990) · Journal of the ACM · doi:10.1145/79147.79161 · Cited by 955
Self-citationA guide to completeness and complexity for modal logics of knowledge and belief
Halpern, J. Y., & Moses, Y. (1992) · Artificial Intelligence · doi:10.1016/0004-3702(92)90049-4 · Cited by 845
Self-citation
Cited by
(1988) · Cited by 16,582
Multiagent systems: algorithmic, game-theoretic, and logical foundations
(2009) · Choice Reviews Online · doi:10.5860/choice.46-5662 · Cited by 1,756
Efficient query evaluation on probabilistic databases
Dalvi, N., & Suciu, D. (2007) · The VLDB Journal · doi:10.1007/s00778-006-0004-3 · Cited by 962
An analysis of first-order logics of probability
Halpern, J. Y. (1990) · Artificial Intelligence · doi:10.1016/0004-3702(90)90019-v · Cited by 585
Self-citation
Metadata
- Authors
- Fagin, R., & Halpern, J. Y.
- Venue
- Journal of the ACM
- Published
- 1994-03
- Volume
- 41
- Issue
- 2
- Pages
- 340-367
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W1480135136
- Cited by
- 477
- References
- 23
- FWCI
- 7.13
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Reasoning about knowledge and probability. https://app.cochat.ai/papers/10.1145/174652.174658
- The paper
- Fagin, R., & Halpern, J. Y. (1994). Reasoning about knowledge and probability. Journal of the ACM. https://doi.org/10.1145/174652.174658
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
