Skip to main content
SpringerLink
Log in
Book cover

International Conference on Principles and Practice of Constraint Programming

CP 1995: Principles and Practice of Constraint Programming — CP '95 pp 53–69Cite as

From local to global consistency in temporal constraint networks

  • Constraint Satisfaction Problems 1
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 976))

Abstract

We study the problem of global consistency for several classes of quantitative temporal constraints which include inequalities, inequations and disjunctions of inequations. In all cases that we consider we identify the level of local consistency that is necessary and sufficient for achieving global consistency and present an algorithm which achieves this level. As a byproduct of our analysis, we also develop an interesting minimal network algorithm.

Most of this work was performed while the author was at the National Technical University of Athens and at Imperial College, London. At Imperial College financial support was received from project CHRONOS funded by EPSRC and DTI.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M.C. Cooper. An optimal k-consistency algorithm. Artificial Intelligence, 41(1):89–95, 1990.

    Google Scholar 

  2. Rina Dechter. From local to global consistency. Artificial Intelligence, 55:87–107, 1992.

    Article  Google Scholar 

  3. Rina Dechter, Itay Meiri, and Judea Pearl. Temporal Constraint Networks. Artificial Intelligence, 49(1–3):61–95, 1991. Special Volume on Knowledge Representation.

    MathSciNet  Google Scholar 

  4. E. Freuder. Synthesizing Constraint Expressions. Communications of ACM, 21(11):958–966, November 1978.

    Article  Google Scholar 

  5. E. Freuder. A Sufficient Condition For Backtrack-Free Search. Journal of ACM, 29(1):24–32, 1982.

    Article  Google Scholar 

  6. A. Gerevini and M. Cristani. Reasoning with Inequations in Temporal Constraint Networks. Technical report, IRST — Instituto per la Ricerca Scientifica e Tecnologica, Povo TN, Italy, 1995. A shorter version will be presented at the IJCAI-95 Workshop on Spatial and Temporal Reasoning, August 1995, Montreal, Canada.

    Google Scholar 

  7. A. Gerevini and L. Schubert. Efficient Temporal Reasoning Through Timegraphs. In Proceedings of IJCAI-93, pages 648–654, 1993.

    Google Scholar 

  8. A. Gerevini, L. Schubert, and S. Schaeffer. Temporal Reasoning in Time-graph I–II. SIGART Bulletin, 4(3):21–25, 1993.

    Google Scholar 

  9. J.-L. Imbert. Variable Elimination for Generalized Linear Constraints. In Proceedings of the 10th International Conference on Logic Programming, 1993.

    Google Scholar 

  10. J.-L. Imbert. Redundancy, Variable Elimination and Linear Disequations. In Proceedings of the International Symposium on Logic Programming, pages 139–153, 1994.

    Google Scholar 

  11. A. Isli. Constraint-Based Temporal Reasoning: a Tractable Point Algebra Combining Qualitative, Metric and Holed Constraints. Technical Report 94-06, LIPN-CNRS URA 1507, Inst. Galilée, Université Paris-Nord, 1994.

    Google Scholar 

  12. J.-L. Imbert and P. van Hentenryck. On the Handling of Disequations in CLP over Linear Rational Arithmetic. In F. Benhamou and A. Colmerauer, editors, Constraint Logic Programming: Selected Research, Logic Programming Series, pages 49–71. MIT Press, 1993.

    Google Scholar 

  13. H. Kautz and P. Ladkin. Integrating Metric and Qualitative Temporal Reasoning. In Proceedings of AAAI-91, pages 241–246, 1991.

    Google Scholar 

  14. Manolis Koubarakis. Dense Time and Temporal Constraints with ≠. In Principles of Knowledge Representation and Reasoning: Proceedings of the Third International Conference (KR'92), pages 24–35. Morgan Kaufmann, San Mateo, CA, October 1992.

    Google Scholar 

  15. M. Koubarakis. Foundations of Temporal Constraint Databases. PhD thesis, Computer Science Division, Dept. of Electrical and Computer Engineering, National Technical University of Athens, February 1994. Available by anonymous ftp from host passion.doc.ic.ac.uk, file IC-Parc/Papers/M.Koubarakis/phd-thesis.ps.z.

    Google Scholar 

  16. Manolis Koubarakis. Complexity Results for First-Order Theories of Temporal Constraints. In Principles of Knowledge Representation and Reasoning: Proceedings of the Fourth International Conference (KR'94), pages 379–390. Morgan Kaufmann, San Francisco, CA, May 1994.

    Google Scholar 

  17. Manolis Koubarakis. Foundations of Indefinite Constraint Databases. In A. Borning, editor, Proceedings of the 2nd International Workshop on the Principles and Practice of Constraint Programming (PPCP'94), volume 874 of Lecture Notes in Computer Science, pages 266–280. Springer Verlag, 1994.

    Google Scholar 

  18. Jean-Louis Lassez and Ken McAloon. A Canonical Form for Generalized Linear Costraints. Technical Report RC15004 (#67009), IBM Research Division, T.J. Watson Research Center, 1989.

    Google Scholar 

  19. I. Meiri. Combining Qualitative and Quantitative Constraints in Temporal Reasoning. Technical Report R-160, Cognitive Systems Laboratory, University of California, Los Angeles, 1991.

    Google Scholar 

  20. I. Meiri. Combining Qualitative and Quantitative Constraints in Temporal Reasoning. In Proceedings of AAAI-91, pages 260–267, 1991.

    Google Scholar 

  21. Peter van Beek. Exact and Approximate Reasoning About Qualitative Temporal Relations. Technical Report TR 90-29, Department of Computing Science, University of Alberta, August 1990.

    Google Scholar 

  22. Peter van Beek. Reasoning About Qualitative Temporal Information. Artificial Intelligence, 58:297–326, 1992.

    Google Scholar 

  23. Peter van Beek and Robin Cohen. Exact and Approximate Reasoning about Temporal Relations. Computational Intelligence, 6:132–144, 1990.

    Google Scholar 

  24. Marc Vilain and Henry Kautz. Constraint Propagation Algorithms for Temporal Reasoning. In Proceedings of AAAI-86, pages 377–382, 1986.

    Google Scholar 

  25. Marc Vilain, Henry Kautz, and Peter van Beek. Constraint Propagation Algorithms for Temporal Reasoning: a Revised Report. In D.S. Weld and J. de Kleer, editors, Readings in Qualitative Reasoning about Physical Systems, pages 373–381. Morgan Kaufmann, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computation, UMIST, P.O. Box 88, M60 1QD, Manchester, UK

    Manolis Koubarakis

Authors
  1. Manolis Koubarakis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ugo Montanari Francesca Rossi

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Koubarakis, M. (1995). From local to global consistency in temporal constraint networks. In: Montanari, U., Rossi, F. (eds) Principles and Practice of Constraint Programming — CP '95. CP 1995. Lecture Notes in Computer Science, vol 976. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60299-2_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-60299-2_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60299-6

  • Online ISBN: 978-3-540-44788-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation