The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
A propositional modal logic of time intervals
Abstract
: In certain areas of artificial intelligence there is need to represent continuous change and to make statements that are interpreted with respect to time intervals rather than time points. To this end we develop a modal temporal logic based on time intervals, a logic which can be viewed as a generalization of pointbased modal temporal logic. We discuss related logics, give an intuitive presentation of the new logic, and define its formal syntax and semantics. We make no assumption about the underlying nature of time, allowing it to be discrete (such as the natural numbers) or continuous (such as the rationals or the reals), linear or branching, complete (such as the reals) or not (such as the rationals). We show, however, that there are formulas in the logic that allow us to distinguish all these situations. We also give a translation of our logic into first-order logic, which allows us to apply some results on first-order logic to our modal one. Finally, we consider the difficulty o...
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
Maintaining knowledge about temporal intervals
Allen, J. F. (1983) · Communications of the ACM · doi:10.1145/182.358434 · Cited by 7,593
Theory of Recursive Functions and Effective Computability.
Feferman, S., & Rogers, H. (1969) · The American Mathematical Monthly · doi:10.2307/2316720 · Cited by 2,788
Towards a general theory of action and time
Allen, J. F. (1984) · Artificial Intelligence · doi:10.1016/0004-3702(84)90008-0 · Cited by 2,559
Theory of Recursive Functions and Effective Computability
Cooper, D. C. (1969) · The Computer Journal · doi:10.1093/comjnl/12.1.28 · Cited by 2,539
A Mathematical Introduction to Logic
(2001) · Elsevier eBooks · doi:10.1016/c2009-0-22107-6 · Cited by 2,387
A logic-based calculus of events
Kowalski, R., & Sergot, M. (1986) · New Generation Computing · doi:10.1007/bf03037383 · Cited by 1,690
Prior, A. (1967) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780198243113.001.0001 · Cited by 1,484
Van Benthem, J. F. A. K. (1983) · Springer eBooks · doi:10.1007/978-94-010-9868-7 · Cited by 541
A Temporal Logic for Reasoning about Processes and Plans*
McDermott, D. (1982) · Cognitive Science · doi:10.1207/s15516709cog0602_1 · Cited by 493
Goldblatt, R. (1986) · Journal of Symbolic Logic · doi:10.2307/2273958 · Cited by 427
Metadata
- Authors
- Halpern, J. Y., & Shoham, Y.
- Venue
- Journal of the ACM
- Published
- 1991-10
- Volume
- 38
- Issue
- 4
- Pages
- 935-962
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W1978654873
- Cited by
- 443
- References
- 14
- FWCI
- 6.28
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A propositional modal logic of time intervals. https://app.cochat.ai/papers/10.1145/115234.115351
- The paper
- Halpern, J. Y., & Shoham, Y. (1991). A propositional modal logic of time intervals. Journal of the ACM. https://doi.org/10.1145/115234.115351
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.