Skip to main content
SpringerLink
Log in

A General Qualitative Framework for Temporal and Spatial Reasoning

  • Published:
Constraints Aims and scope Submit manuscript

Abstract

To offer a generic framework which groups together several interval algebra generalizations, we simply define a generalized interval as a tuple of intervals. An atomic relation between two generalized intervals is a matrix of atomic relations of Interval Algebra. After introducing the generalized relations we focus on the consistency problem of generalized constraint networks and we present sets of generalized relations for which this problem is tractable, in particular the set of the strongly-preconvex relations.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Allen, J. F. (1981). An interval-based representation of temporal knowledge. In Proc. 7th International Joint Conference on Artificial Intelligence, pages 221-226.

  2. Allen, J. F. (1983). Maintaining knowledge about temporal intervals. Communications of the ACM, 26: 832-843.

  3. Balbiani, P., Condotta, J.-F., &; Fariñas del Cerro, L. (1998). A model for reasoning about bidimensional temporal realtions. In Cohn, A. G., Schubert, L., &; Shapiro, S. C., eds., Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR '98), Morgan Kaufmann, pages 124-130.

  4. Balbiani, P., Condotta, J.-F., &; Fariñas del Cerro, L. (1999). A new tractable subclass of the rectangle algebra. In Dean, T., ed., Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI '99), pages 442-447.

  5. Balbiani, P., Condotta, J.-F., &; Fariñas del Cerro, L. (1999). A tractable subclass of the block algebra: constraint propagation and preconvex relations. In The Ninth Portuguese Conference on Artificial Intelligence (EPIA '99),vora, Portugal, pages 75-89.

  6. Balbiani, P., Condotta, J.-F., Fariñas del Cerro, L., &; Osmani, A. (1998). A model for reasoning about generalized intervals. In Giunchiglia, F., ed., Proceedings of the Eight International Conference on Artificial Intelligence: Methods, Systems, Application (AIMSA '98), LNAI 1480, pages 50-61.

  7. Condotta, J.-F. (2000). The augmented interval and rectangle networks. In Proceedings of the Seventh International Conference on Principles of Knowledge (KR'2000), Brekenbridge, USA, pages 571-579.

  8. Condotta, J.-F. (2000). Tractable sets of the generalized interval algebra. In Proceedings of the 14th European Conference on Artificial Intelligence (ECAI '2000), Berlin, pages 78-82.

  9. Dechter, R., Meiri, I., &; Pearl, J. (1991). Temporal constraint networks. Artificial Intelligence, 49(1-3): 61-95.

    Google Scholar 

  10. Güsgen, H. W. (1989). Spatial reasoning based on Allen's Temporal Logic. Teachnical Report TR-89-049, International Computer Science Institute, Berkeley.

    Google Scholar 

  11. Khatib, L. (1994). Reasoning with non-convex time intervals. Ph.D. thesis, Melbourne, Florida: Florida Institute of Technology.

    Google Scholar 

  12. Khatib, L. (1996), Reasoning with sequences of intervals for efficient constraint propagation. In Proceedings of the Florida Artificial Intelligence Research Symposium (FLAIRS-96).

  13. Ladkin, P. (1986). Time representation: a taxonomy of internal relations. In Kehler, T. &; Rosenschein, S., eds., In Proceedings of the 5th National Conference on Artificial Intelligence, Vol. 1. Los Altos, CA, USA, Morgan Kaufmann, pages 360-366.

    Google Scholar 

  14. Ligozat, G. (1994). Tractable relations in temporal reasoning: pre-convex relations. In Proceedings of the ECAI Workshop on Spatial and Temporal Reasoning, Amsterdam, pages 99-108.

  15. Ligozat, G. (1996). A new proof of tractability for ORD-Horn relations. In Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI '96), Vol. 1, pages 395-401.

  16. Ligozat, G. F. (1991). On generalized interval calculi. In Proceeidings of the Ninth National Conference on Artificial Intelligence (AAAI '91). Menlo Park/Cambridge, AAAI Press/The MIT Press, pages 234-240.

    Google Scholar 

  17. Mackworth, A. K., &; Freuder, E. C. (1985). The complexity of some polynomial network consistency algorithms for constraint satisfaction problem. Artificial Intelligence, 25(1): 65-74.

    Google Scholar 

  18. Montanari, U. (1974). Networks of constraints: fundamental properties and application to picture processing. Information Sciences, 7(2): 95-132.

    Google Scholar 

  19. Morris, R. A., Shoaff, W. D., &; Al-Khatib, L. (1993). Path consistency in a network of non-convex intervals. In Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence (IJCAI '93).

  20. Nebel, B., &; Bürckert, H.-J. (1994). Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra. In Proceedings of the 12th National Conference of the American Association for Artificial Intelligence. Cambridge, MA, USA, MIT Press, pages 356-361. Extended version published in Journal of the ACM.

    Google Scholar 

  21. Nebel, B., &; Bürckert, H.-J. (1995). Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra. Journal of the ACM, 42(1): 43-66.

    Google Scholar 

  22. Nökel, K. (1991). Temporally Distributed Symptoms in Technical Diagnosis, Lecture Notes in Computer Science 517: 1-184.

  23. van Beek, P. (1990). Exact and approximate reasoning about qualitative temporal realtions. Ph.D. thesis, University of Alberta, Canada.

    Google Scholar 

  24. van Beek, P. (1992). Reasoning about qualitative temporal information.Artificial Intelligence, 58(1-3): 297-326.

    Google Scholar 

  25. van Beek, P., &; Cohen, R. (1990). Exact and approximate reasoning about temporal realations. Computational Intelligence, 6: 133-144.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centre de Recherche en Informatique de Lens, Université d'Artois, Rue Jean Souvraz, SP18, F-63307, Lens Cedex, France

    Jean-François Condotta

Authors
  1. Jean-François Condotta
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Condotta, JF. A General Qualitative Framework for Temporal and Spatial Reasoning. Constraints 9, 99–121 (2004). https://doi.org/10.1023/B:CONS.0000024047.02149.64

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:CONS.0000024047.02149.64

Search

Navigation