Cited by 7,593Logic, Reasoning, and KnowledgeConstraint Satisfaction and OptimizationAI-based Problem Solving and Planning

Maintaining knowledge about temporal intervals

Open access
Allen, James F.·1983·Communications of the ACM

Abstract

article Free Access Share on Maintaining knowledge about temporal intervals Author: James F. Allen Univ. of Rochester, Rochester, NY Univ. of Rochester, Rochester, NYView Profile Authors Info & Claims Communications of the ACMVolume 26Issue 11Nov. 1983 pp 832–843https://doi.org/10.1145/182.358434Online:01 November 1983Publication History 5,173citation11,531DownloadsMetricsTotal Citations5,173Total Downloads11,531Last 12 Months644Last 6 weeks101 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

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/182.358434

Cites

0 citation errors · 0 not checkable

Statistics

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

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Allen-relation selection on the operator output preserves the bitemporal-tuple type by closure of Allen's thirteen interval relations and the twelve-relation transitivity table that omits equality.

    “Allen-relation selection on the operator output preserves the bitemporal-tuple type by closure of Allen's thirteen interval relations and the twelve-relation transitivity table that omits equality [3].”

    From TOKI: A Bitemporal Operator Algebra for Contradiction Resolution in LLM-Agent Persistent Memory (2026) · cites this paper as [3]

    Figure 2 identifies thirteen possible interval relationships, and Figure 4 is captioned as a transitivity table for twelve relations, omitting equality. The discussion of the basic algorithm describes transitive closure of temporal relations, but our copy does not establish that Allen-relation selection on an operator output preserves a bitemporal-tuple type. (LLM, conf=0.88)

    Experimental — accuracy not yet measured
  • Closure under Allen-relation selection follows from the transitivity table over the twelve non-equality relations.

    “Closure under Allen-relation selection follows from the transitivity table over the twelve non-equality relations [3].”

    From TOKI: A Bitemporal Operator Algebra for Contradiction Resolution in LLM-Agent Persistent Memory (2026) · cites this paper as [3]

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 13

  1. Allen, J. F., Frisch, A. M., and Litman, D. J. ARGOT: The Rochester dialogue system, Proc. Nat. Conf. on Artificial Intelligence, AAAI 82, Pittsburgh, Pa., Aug. 1982.
  2. Allen, J. F., and Kautz, H. A. "A model of naive temporal reasoning," to appear in J. R. Hobbs and R. Moore (Ed}., Contributions in Artificial Intelligence, Vol. 1, Ablex Pub.
  3. Allen, J. F., and Koomen, l-A. Planning using a temporal world model. Submitted to 8th Int. Joint Conf. Artificial Intelligence, Aug. 1983.
  4. Bruce, B. C. A model for temporal references and its application in a question answering program. Artificial Intelligence 3 (1972), 1-25.
  5. Bubenko, J. A., Jr. Information modeling in the context of system development. Proc. IFIP Congress 80, Oct. 1980, North-Holland, Am- sterdam.
  6. Freuder, E. C. A sufficient condition for backtrack-flee search. J. ACM 29, 1 (Jan. 1982), 24-32.
  7. Hayes, P. J. The Naive Physics manifesto. In Expert Systems, D. Mi- chie (Ed.), Edinburgh U. Press, 1979.
  8. Hendrix, G. G. Modeling simultaneous actions and continuous proc- esses, Artificial Intelligence 4, 3 (1973), 145-180.
  9. Kahn, K. M., and Gorry, A. G. Mechanizing temporal knowledge. Artificial Intelligence 9, 2 (1977). 87-108.
  10. McCarthy, J., and Hayes, P. Some philosophical problems from the standpoint of artificial intelligence. Machine Intelligence 4, Edinburgh U. Press, 1969.
  11. Rescher, N., and Urquhart, A. Temporal Logic. Springer-Verlag, New York, 1971.
  12. Sacerdoti, E. D. A Structure for Plans and Behavior. Elsevier North- Holland, New York, 1977.
  13. Vilain, M. A system for reasoning about time. Proc. AAAI 82, Pitts- burgh, Pa., Aug. 1982. CR Categories and Subject Descriptors: 1.2.4 [Knowledge Representa- tion Formalisms and Methods]: Representations--time, temporal repre- sentation; 1.2.3 Deduction and Theorem Proving]: Deduction--constraint propagation, temporal reasoning; H.3.3 [Information Search and Re- trieval]: Clustering, Retrieval Methods General Terms: Algorithms Additional Key Words and Phrases: temporal interval, interval rea- soning, interval representation.

Cited by

Sorted by citations

Authors
Allen, J. F.
Affiliations
University of Rochester (US)
Corresponding author
Allen, James F.
Venue
Communications of the ACM
Published
1983-11
Volume
26
Issue
11
Pages
832-843
ISSN
  • 0001-0782 (ISSN-L)
  • 1557-7317
OpenAlex
W2161484642
Cited by
7,593
References
0
Citations by year
2026: 79 · 2025: 88 · 2024: 133 · 2023: 126 · 2022: 115 · 2021: 159 · 2020: 194 · 2019: 175 · 2018: 212 · 2017: 246 · 2016: 291 · 2015: 267 · 2014: 279 · 2013: 326 · 2012: 322
FWCI
27.16
Type
journal article
Language
en
Open access
Locations
Communications of the ACM (publishedVersion)
Funders
  • National Science Foundation (8210564)
  • Office of Naval Research (N00014)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Logic, Reasoning, and Knowledge
  • Physical Sciences › Computer Science › Computer Networks and Communications › Constraint Satisfaction and Optimization
  • Physical Sciences › Computer Science › Artificial Intelligence › AI-based Problem Solving and Planning
Keywords
temporal reasoning, time intervals, interval arithmetic, knowledge representation, temporal logic, Allen's interval algebra

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