The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Cooperation, Knowledge, and Time: Alternating-time Temporal Epistemic Logic and its Applications
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
Cites
Intelligent agents: theory and practice
Wooldridge, M., & Jennings, N. R. (1995) · The Knowledge Engineering Review · doi:10.1017/s0269888900008122 · Cited by 6,810
Self-citation(1994) · Cited by 5,513
An Introduction to MultiAgent Systems
Wooldridge, M. (2002) · Cited by 5,394
Self-citationClarke, E. M., & Schlingloff, B. (1999) · Cited by 4,226
(1994) · Mathematical Social Sciences · doi:10.1016/0165-4896(94)90005-1 · Cited by 3,517
Fagin, R., Halpern, J. Y., Moses, Y., & Vardi, M. (1995) · The MIT Press eBooks · doi:10.7551/mitpress/5803.001.0001 · Cited by 2,610
EMERSON, E. A. (1990) · Formal Models and Semantics · doi:10.1016/b978-0-444-88074-1.50021-4 · Cited by 2,585
Burrows, M., Abadi, M., & Needham, R. (1990) · ACM Transactions on Computer Systems · doi:10.1145/77648.77649 · Cited by 2,523
Harel, D., Kozen, D. C., & Tiuryn, J. (2000) · Cited by 1,439
“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Emerson, E. A., & Halpern, J. Y. (1986) · Journal of the ACM · doi:10.1145/4904.4999 · Cited by 1,009
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
A 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
(1992) · Cited by 691
Epistemic Logic for AI and Computer Science
Meyer, J. C., & van der Hoek, W. (1995) · Cambridge University Press eBooks · doi:10.1017/cbo9780511569852 · Cited by 628
A Formal Theory of Knowledge and Action
Moore, R. C. (1984) · Defense Technical Information Center (DTIC) · Cited by 512
Venema, Y. (2002) · Theory and Practice of Logic Programming · doi:10.1017/s1471068402001412 · Cited by 482
A Modal Logic for Coalitional Power in Games
Pauly, M. (2002) · Journal of Logic and Computation · doi:10.1093/logcom/12.1.149 · Cited by 466
MOCHA: Modularity in model checking
Alur, R., Henzinger, T. A., Mang, F. Y. C., Qadeer, S., Rajamani, S. K., & Tasiran, S. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0028774 · Cited by 382
Brachman, R. J., Allen, J. F., Kautz, H., et al. (1991) · Medical Entomology and Zoology · Cited by 259
The complexity of reasoning about knowledge and time. I. Lower bounds
Halpern, J. Y., & Vardi, M. Y. (1989) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(89)90039-1 · Cited by 252
Branching vs. Linear Time: Final Showdown
Vardi, M. Y. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45319-9_1 · Cited by 245
Pauly, M. (2000) · UvA-DARE (University of Amsterdam) · Cited by 207
The complexity of reasoning about knowledge and time
Halpern, J. Y., & Vardi, M. Y. (1986) · Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 · doi:10.1145/12130.12161 · Cited by 182
Extensive Games as Process Models
van Benthem, J. (2002) · Journal of Logic Language and Information · doi:10.1023/a:1015534111901 · Cited by 121
The Logic of Distributed Protocols
Ladner, R. E., & Reif, J. H. (1986) · Elsevier eBooks · doi:10.1016/b978-0-934613-04-0.50016-8 · Cited by 61
A Logic for Characterizing Multiple Bounded Agents
Grant, J., Kraus, S., & Perlis, D. R. (2000) · Autonomous Agents and Multi-Agent Systems · doi:10.1023/a:1010050603219 · Cited by 42
Knowledge sharing among ideal agents
Lomuscio, A. R. (1999) · University of Birmingham Institutional Research Archive (University of Birmingham) · Cited by 30
Cited by
Logical Dynamics of Information and Interaction
van Benthem, J. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9780511974533 · Cited by 505
Metadata
- Authors
- van der Hoek, W., & Wooldridge, M.
- Venue
- Studia Logica
- Published
- 2003-10
- Volume
- 75
- Issue
- 1
- Pages
- 125-157
- ISSN
- 0039-3215 (ISSN-L)
- 1572-8730
- OpenAlex
- W1497329491
- Cited by
- 269
- References
- 27
- FWCI
- 15.90
- Type
- journal article
- Language
- en
- Open access
- closed
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
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.