Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 188

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Complexity and algorithms for reasoning about time: a graph-theoretic approach

Open access
Golumbic, Martin Charles, Shamir, Ron · 1993 · Journal of the ACM

Abstract

Temporal events are regarded here as intervals on a time line, This paper deals with problems m reasoning about such intervals when the prccisc topological relationship between them is unknown or only partially specified, This work unifies notions of interval algebras in artificial intelligence with those of interval orders and mterwd gr~phs m combmatorlcs.The satqfahihty, znuumal Iabeltng, all solutLons.and all rcakatlons problems we considered for temporal (internal ) datti.Several versions are investigated by restricting the possible interval relationships yielding different complexity results, We show that even when the temporal data comprises of subsets of relatlons based on mtersectlon and precedence only, the satisfiabdlty question IS NP-complete.On the positive side, we give efficient algorithms for several restrictions of the problem.In the process, the irzterLa/ ,qrap/z satzdwzc/z problem is introduced, and is shown to be NP-complete This problem IS also important in molecular hlology, where it arlscs In physical mapping of DNA material.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/174147.169675

Cites

2 of 2 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 2 references

Cited by

See all 188

Metadata

Authors
Golumbic, M. C., & Shamir, R.
Venue
Journal of the ACM
Published
1993-11
Volume
40
Issue
5
Pages
1108-1133
ISSN
  • 0004-5411 (ISSN-L)
  • 1557-735X
OpenAlex
W1972734518
Cited by
188
References
2
FWCI
14.88
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: Complexity and algorithms for reasoning about time: a graph-theoretic approach. https://app.cochat.ai/papers/10.1145/174147.169675
The paper
Golumbic, M. C., & Shamir, R. (1993). Complexity and algorithms for reasoning about time: a graph-theoretic approach. Journal of the ACM. https://doi.org/10.1145/174147.169675

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.