Computing transitivity tables: A challenge for automated theorem provers

  • D. A. Randell
  • A. G. Cohn
  • Z. Cui
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 607)


Implementations of Allen's interval-based temporal logic and a recently developed simulation system for reasoning about space and time, both require the use of transitivity tables. Although strategies exist to construct such tables, the proofs which underly the entries in the table are both tedious to do and in some cases difficult to secure. Often a difficult proof is only obtained via lemmas; moreover, finding models for satisfiable sets of dyadic relations in the theory introduces its own difficulties. This paper presents the problems. Any automated theorem prover which can effectively generate the entries for such transitivity tables would mark significant progress in automated theorem proving.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Allen, J. F. Maintaining Knowledge about Temporal Intervals. Comm. ACM 26(11), 1983.Google Scholar
  2. [2]
    Clarke, B. L. [1981] A Calculus of Individuals based on ‘Connection', Notre Dame Journal of Formal Logic, 22(3).Google Scholar
  3. [3]
    Clarke, B. L. [1985] Individuals and Points, Notre Dame Journal of Formal Logic, 26(1).Google Scholar
  4. [4]
    Cui, Z., Randell, D. A. and Cohn, A. G. Qualitative Simulation based on Logical Formalism of Space and Time, to appear in Proceedings of AAAI-92, AAAI Press, 1992.Google Scholar
  5. [5]
    Freksa, C. Qualitative Spatial Reasoning, in Proceedings of Workshop RAUM, University of Koblenz, 1990.Google Scholar
  6. [6]
    McCune W. OTTER 2.0 Users Guide. Arg. Nat. Lab, Argonne, Illinois, 1990.Google Scholar
  7. [7]
    Nökel, K. Convex Relations between Time Intervals, SEKI Report SR-88-17, Universität Kaiserslautern, 1988.Google Scholar
  8. [8]
    Randell, D. A. Analysing the Familiar: Reasoning about Space and Time in the Everyday World, Ph.D thesis, University of Warwick, UK, 1991.Google Scholar
  9. [9]
    Randell, D. A. & Cohn, A. G. Modeling Topological and Metrical Properties in Physical Processes. in Proc. of 1st Int. Conf. on Princ. of Know. Rep. and Reasoning, ed. R.J. Brachman, et al, Morgan Kaufmann, San Mateo, Ca., 1989Google Scholar
  10. [10]
    Randell, D. A. & Cohn, A. G. Exploiting Lattices in a Theory of Space and Time. in Computers and Mathematics, with pplications, Vol 23, No 6–9, 1992.Google Scholar
  11. [11]
    Randell, D. A., Cohn, A. G. and Cui, Z. Naive Topology: modeling the force pump. to appear in P. Struss and B. Faltings (eds) Recent Advances in Qualitative Physics, MIT press, 1992.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • D. A. Randell
    • 1
  • A. G. Cohn
    • 1
  • Z. Cui
    • 1
  1. 1.Division of Artificial Intelligence School of Computer StudiesUniversity of LeedsLeedsEngland

Personalised recommendations