The DOI matches its Crossref record.
The complexity of reasoning about knowledge and time
Open accessAbstract
We study the propositional modal logic of knowledge and time for distributed systems.Models are categorized in terms of three parameters: whether processors have bounded memory or unbounded memory, whether time is synchronous or asynchronous, and whether time is linear or branching.We show that if we have common knowledge in the language, then in the unbounded memory case the validity problem is undecidable.Without common knowledge, the validity problem is hard for nonelementary time, and in the synchronous case is actually decidable in nonelementary time.If processors have bounded memory, then there is no real interaction between knowledge and time, and the validity problem is no worse than the validity problem for knowledge and time separately.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cited by
Intelligent agents: theory and practice
Wooldridge, M., & Jennings, N. R. (1995) · The Knowledge Engineering Review · doi:10.1017/s0269888900008122 · Cited by 6,810
Agent theories, architectures, and languages: A survey
Wooldridge, M., & Jennings, N. R. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-58855-8_1 · Cited by 1,363
Belief, awareness, and limited reasoning
Fagin, R., & Halpern, J. Y. (1987) · Artificial Intelligence · doi:10.1016/0004-3702(87)90003-8 · Cited by 885
Self-citationBurrows, M., Abadi, M., & Needham, R. (1989) · Proceedings of the twelfth ACM symposium on Operating systems principles · doi:10.1145/74850.74852 · Cited by 641
Cooperation, Knowledge, and Time: Alternating-time Temporal Epistemic Logic and its Applications
van der Hoek, W., & Wooldridge, M. (2003) · Studia Logica · doi:10.1023/a:1026185103185 · Cited by 269
Metadata
- Authors
- Halpern, J. Y., & Vardi, M. Y.
- Venue
- Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86
- Publisher
- ACM Press
- Published
- 1986
- Pages
- 304-315
- OpenAlex
- W2010508644
- Cited by
- 182
- References
- 0
- FWCI
- 4.93
- Type
- conference paper
- Language
- en
- Open access
- gold
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: The complexity of reasoning about knowledge and time. https://app.cochat.ai/papers/10.1145/12130.12161
- The paper
- Halpern, J. Y., & Vardi, M. Y. (1986). The complexity of reasoning about knowledge and time. Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86. https://doi.org/10.1145/12130.12161
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.