Document Open Access Logo

The Time Ontology of Allen's Interval Algebra

Authors Michael Grüninger, Zhuojun Li

PDF
Thumbnail PDF

File

LIPIcs.TIME.2017.16.pdf
  • Filesize: 0.58 MB
  • 16 pages

Document Identifiers

Author Details

Michael Grüninger
Zhuojun Li

Cite As Get BibTex

Michael Grüninger and Zhuojun Li. The Time Ontology of Allen's Interval Algebra. In 24th International Symposium on Temporal Representation and Reasoning (TIME 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 90, pp. 16:1-16:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017) https://doi.org/10.4230/LIPIcs.TIME.2017.16

Abstract

Allen's interval algebra is a set of thirteen jointly exhaustive and pairwise disjoint binary relations representing temporal relationships between pairs of timeintervals. Despite widespread use, there is still the question of which time ontology actually underlies Allen's algebra. Early work specified a first-order ontology that can interpret Allen's interval algebra; in this paper, we identify the first-order ontology that is logically synonymous with Allen's interval algebra, so that there is a one-to-one correspondence between models of the ontology and solutions to temporal constraints that are specified using the temporal relations. We further prove a representation theorem for the ontology, thus characterizing its models up to isomorphism.

Subject Classification

Keywords
  • time ontology
  • intervals
  • composition table
  • first-order logic
  • synonymy

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. J. Allen and P. Hayes. Moments and points in an interval-based temporal logic. Computational Intelligence, 5:225-238, 1989. Google Scholar
  2. James F. Allen. Maintaining knowledge about temporal intervals. Commun. ACM, 26(11):832-843, 1983. URL: http://dx.doi.org/10.1145/182.358434.
  3. B. Bennett, A. Isli, and A. G. Cohn. When does a composition table provide a complete and tractable proof procedure for a relational constraint language? In Proceedings of the IJCAI-97 workshop on Spatial and Temporal Reasoning, 1997. Google Scholar
  4. J. . Logic of Time. Springer Verlag, 1983. Google Scholar
  5. R. Diestel. Graph Theory. Springer Verlag, 1997. Google Scholar
  6. H. Enderton. Mathematical Introduction to Logic. Academic Press, 1972. Google Scholar
  7. Michael Grüninger, Torsten Hahmann, Ali Hashemi, Darren Ong, and Atalay Özgövde. Modular first-order ontologies via repositories. Applied Ontology, 7(2):169-209, 2012. Google Scholar
  8. P. Hayes. Catalog of temporal theories. Technical Report Technical Report UIUC-BI-AI-96-01, University of Illinois Urbana-Champagne, 1996. Google Scholar
  9. W. Hodges. Model theory. Cambridge University Press Cambridge, 1993. Google Scholar
  10. P. B. Ladkin. Models for axioms of time intervals. In Proceedings of AAAI-87, 1987. Google Scholar
  11. W. McCune. Prover9 and Mace4. 2010. URL: http://www.cs.unm.edu/~mccune/prover9/.
  12. Charles Pinter. Properties preserved under definitional equivalence and interpretations. Zeitschrift fur Mathematik Logik und Grundlagen der Mathematik, 24:481-488, 1978. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact