The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Exact and approximate reasoning about temporal relations1
Abstract
Allen gives an algebra for representing qualitative temporal information about the relationships between pairs of intervals. In this paper, we address a fundamental reasoning task that arises in applications of the algebra: Given (possibly indefinite) knowledge about the relationships between intervals, find all feasible relationships between two intervals. We call this the minimal labels problem. Finding the minimal labels can be viewed as computing the deductive consequences of our knowledge. Determining exact solutions to this problem has been shown to be (almost assuredly) intractable. Allen gives an approximation algorithm based on constraint propagation. We present new approximation algorithms; determine analytically under what conditions the algorithms are exact; and examine, through some computational experiments, the quality of the approximate solutions produced by the algorithms. We also give a simple test for predicting when the approximation algorithms will and will not produce good quality approximations. Finally, we survey three example applications of the interval algebra chosen from the literature to show where the results of this paper could be useful.
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 · cited 9×
“Allen (1983) gives an O( n 3 ) approximation algorithm for the all-to-all minimal labels problem that is a special case of path consistency algorithms (Montanari, 1974; Mack-worth, 1977).”
BackgroundMethodInfluential
Cited by
Handbook of Constraint Programming
(2006) · Foundations of Artificial Intelligence · doi:10.1016/s1574-6526(06)x8001-x · Cited by 1,483
Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra
Nebel, B., & Bürckert, H.-J. (1995) · Journal of the ACM · doi:10.1145/200836.200848 · Cited by 406
Reasoning about qualitative temporal information
van Beek, P. (1992) · Artificial Intelligence · doi:10.1016/0004-3702(92)90011-l · Cited by 276
Self-citation
Metadata
- Authors
- Van Beek, P., & Cohen, R.
- Venue
- Computational Intelligence
- Publisher
- Wiley
- Published
- 1990-08
- Volume
- 6
- Issue
- 3
- Pages
- 132-144
- ISSN
- 0824-7935 (ISSN-L)
- 1467-8640
- OpenAlex
- W2071064455
- Cited by
- 196
- References
- 1
- FWCI
- 7.00
- 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: Exact and approximate reasoning about temporal relations1. https://app.cochat.ai/papers/10.1111/j.1467-8640.1990.tb00130.x
- The paper
- Van Beek, P., & Cohen, R. (1990). Exact and approximate reasoning about temporal relations1. Computational Intelligence. https://doi.org/10.1111/j.1467-8640.1990.tb00130.x
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.