When Tables Tell It All: Qualitative Spatial and Temporal Reasoning Based on Linear Orderings

  • Gérard Ligozat
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2205)


In [8] Bennett, Isli and Cohn put out the following challenge to researchers working with theories based on composition tables (CT): give a general characterization of theories and relational constraint languages for which a complete proof procedure can be specified by a CT. For theories based on CTs, they make the distinction between a weak, consistency-based interpretation of the CT, and a stronger extensional definition. In this paper, we take up a limited aspect of the challenge, namely, we characterize a subclass of formalisms for which the weak interpretation can be related in a canonical way to a structure based on a total ordering, while the strong interpretations have the property of aleph-zero categoricity (all countable models are isomorphic).

Our approach is based on algebraic, rather than logical, methods. It can be summarized by two keywords: relation algebra and weak representation.


temporal reasoning spatial reasoning relation algebra weak representation complete theory 


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. of the ACM, 26:11, 832–843, 1983.zbMATHCrossRefGoogle Scholar
  2. [2]
    F.D. Anger, D. Mitra, and R.V. Rodriguez. Temporal Constraint Networks in Nonlinear Time. In Proc. of the ECAI-98 Workshop on Spatial and Temporal Reasoning (W22), pages 33–39, Brighton, UK.Google Scholar
  3. [3]
    P. Balbiani and A. Osmani. A model for reasoning about topologic relations between cyclic intervals. In Proc. of KR-2000, Breckenridge, Colorado, 2000.Google Scholar
  4. [4]
    Ph. Balbiani, J.-F. Condotta, and L. Fariñas del Cerro. A model for reasoning about bidimensional temporal relations. In Proc. of KR-98, pages 124–130, 1998.Google Scholar
  5. [5]
    Ph. Balbiani, J.-F. Condotta, and L. Fariñas del Cerro. A new tractable subclass of the rectangle algebra. In Proc. of IJCAI-99, pages 442–447, 1999.Google Scholar
  6. [6]
    Ph. Balbiani, J.-F. Condotta, and L. Fariñas del Cerro. Spatial reasoning about points in a multidimensional setting. In Proc. of the IJCAI-99 Workshop on Spatial and Temporal Reasoning, pages 105–113, 1999.Google Scholar
  7. [7]
    Ph. Balbiani, J.-F. Condotta, and L. Fariñas del Cerro. A tractable subclass of the block algebra: constraint propagation and preconvex relations. In Proc. of the Ninth Portuguese Conference on Artificial Intelligence (EPIA’99), pages 75–89, 1999.Google Scholar
  8. [8]
    B. Bennett, A. Isli, and A. Cohn. When does a Composition Table Provide a Complete and Tractable Proof Procedure for a Relational Constraint Language? In Proc. of the IJCAI-97 Workshop on Spatial and Temporal Reasoning, pages 75–81, Nagoya, Japan, 1997.Google Scholar
  9. [9]
    M. Broxvall and P. Jonsson. Disjunctive Temporal Reasoning in Partially Ordered Models of Time. In Proc. of AAAI-2000, Austin, Texas, 2000.Google Scholar
  10. [10]
    M.J. Egenhofer and R. Franzosa. Point-set topological spatial relations. Int. J. Geo. Info. Sys. 5(2), 161–174, 1991.CrossRefGoogle Scholar
  11. [11]
    B. Jónsson and A. Tarski. Boolean algebras with operators, part II. American J. of Mathematics, 74:127–162, 1952.zbMATHCrossRefGoogle Scholar
  12. [12]
    P. Ladkin. Models of Axioms for Time Intervals. In Proc. of AAAI-87, 1987.Google Scholar
  13. [13]
    G. Ligozat. Generalized Intervals: A Guided Tour. In Proc. of the ECAI-98 Workshop on Spatial and Temporal Reasoning (W22), pages 11–18, Brighton, UK, 1998.Google Scholar
  14. [14]
    G. Ligozat. Weak Representations of Interval Algebras. In Proc. of AAAI-90, pages 715–720, 1990.Google Scholar
  15. [15]
    G. Ligozat. On generalized interval calculi. In Proc. of AAAI-91, pages 234–240, 1991.Google Scholar
  16. [16]
    G. Ligozat. Reasoning about Cardinal Directions. J. of Visual Languages and Computing, 9:23–44, 1998.CrossRefGoogle Scholar
  17. [17]
    G. Ligozat. Simple Models for Simple Calculi. In C. Freksa and D.M. Mark, editors, Proc. of COSIT’99, number 1661 in LNCS, pages 173–188. Springer Verlag, 1999.Google Scholar
  18. [18]
    C.H. Papadimitriou, D. Suciu and V. Vianu. Topological Queries in Spatial Databases. In Proc. ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, pages 81–92, 1996.Google Scholar
  19. [19]
    D. Randell, Z. Cui, and T. Cohn. A spatial logic based on regions and connection. In B. Neumann, editor, Proc. of KR-92, pages 165–176, San Mateo, CA, 1992. Morgan Kaufmann.Google Scholar
  20. [20]
    J. Renz. A canonical model of the region connection calculus. In Proc. of KR’98, Trento, Italy, 1998.Google Scholar
  21. [21]
    L. Segoufin and V. Vianu. Querying Spatial Databases via Topological Invariants. In Proc. ACM Symp. on Principles of Database Systems, 1998.Google Scholar
  22. [22]
    A. Tarski. On the calculus of relations. Journal of Symbolic Logic, 6:73–89, 1941.zbMATHCrossRefMathSciNetGoogle Scholar
  23. [23]
    P.K. Tsang. Foundations of Constraint Satisfaction. Academic Press, 1993.Google Scholar
  24. [24]
    D. van Dalen. Logic and Structure. Springer, 1997.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Gérard Ligozat
    • 1
  1. 1.LIMSIParis-Sud UniversityOrsayFrance

Personalised recommendations