Skip to main content
SpringerLink
Log in

Some Observations on Durations, Scheduling and Allen’s Algebra

  • Conference paper
  • First Online:
Principles and Practice of Constraint Programming – CP 2000 (CP 2000)

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

Abstract

Representing and reasoning about time has for a long time been acknowledged as one of the core areas of artificial intelligence and a large number of formalisms for temporal constraint reasoning (TCR) have been proposed in the literature. Important examples are the time point algebra [16], Allen’s algebra [1], simple temporal constraints [5] and the qualitative algebra [12]. These formalisms are almost exclusively dealing with the relative positions of time points (qualitative information) and/or the absolute position of time points on the time line (quantitative or metric information).

This research has been supported by the Swedish Foundation for Strategic Research as part of the project “Computational Complexity of Temporal and Spatial Constraint Reasoning”.

This research has been supported by the Swedish Research Council for Engineering Sciences (TFR) under grant 97-301.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Article  MATH  Google Scholar 

  2. F. D. Anger and R. V. Rodriguez. Effective scheduling of tasks under weak temporal interval constraints. In B. Bouchon-Meunier, R. R. Yager, and L. A. Zadeh, editors, Advances in Intelligent Computing-IPMU’94, pages 584–594. Springer, Berlin, 1994.

    Google Scholar 

  3. C.-C. Cheng and S. F. Smith. Generating Feasible Schedules under Complex Metric Constraints. In Proceedings of the 12th National Conference on Artificial Intelligence (AAAI-94), pages 1086–1091. AAAI Press, 1994.

    Google Scholar 

  4. S. Belhadji and A. Isli. Temporal constraint satisfaction techniques in job shop scheduling problem solving. Constraints, 3:203–212, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  5. R. Dechter, I. Meiri, and J. Pearl. Temporal constraint networks. Artificial Intelligence, 49:61–95, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  6. T. Drakengren and P. Jonsson. Eight maximal tractable subclasses of Allen’s algebra with metric time. Journal of Artificial Intelligence Research, 7:25–45, 1997.

    MATH  MathSciNet  Google Scholar 

  7. T. Drakengren and P. Jonsson. Towards a complete classification of tractability in Allen’s algebra. In IJCAI [9].

    Google Scholar 

  8. T. Drakengren and P. Jonsson. Twenty-one large tractable subclasses of Allen’s algebra. Artificial Intelligence, 1997. To appear.

    Google Scholar 

  9. Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI-97), Nagoya, Japan, Aug. 1997. Morgan Kaufmann.

    Google Scholar 

  10. P. Jonsson and C. Bäckström. A unifying approach to temporal constraint reasoning. Artificial Intelligence, 102(1):143–155, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  11. M. Koubarakis. Tractable disjunctions of linear constraints. In Proceedings of the 2nd International Conference on Principles and Practice for Constraint Programming, pages 297–307, Cambridge, MA, Aug. 1996.

    Google Scholar 

  12. I. Meiri. Combining qualitative and quantitative constraints in temporal reasoning. Artificial Intelligence, 87(1–2):343–385, 1996.

    Article  MathSciNet  Google Scholar 

  13. I. Navarrete and R. Marin. Qualitative temporal reasoning with points and duarations. In IJCAI [9], pages 1454–1459.

    Google Scholar 

  14. B. Nebel and H.-J. Bürckert. Reasoning about temporal relations: A maximal tractable subclass of Allen’s interval algebra. Journal of the ACM, 42(1):43–66, 1995.

    Article  MATH  Google Scholar 

  15. A. K. Pujari and A. Sattar. A new framework for reasoning about points, intervals and durations. In Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99), pages 1259–1267, Stockholm, Sweden, 1999.

    Google Scholar 

  16. M. B. Vilain, H. A. Kautz, and P. G. 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, San Mateo, Ca, 1989.

    Google Scholar 

  17. R. Wetprasit and A. Sattar. Temporal reasoning with qualitative and quantitative information about points and durations. In Proceedings of the 15th National Conference on Artificial Intelligence (AAAI-98), pages 656–663. AAAI Press, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Information Science, Linköpings Universitet, S-581 83, Linköping, Sweden

    Ola Angelsmark & Peter Jonsson

Authors
  1. Ola Angelsmark
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Peter Jonsson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of California at Irvine, Irvine, CA, 92697, USA

    Rina Dechter

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Angelsmark, O., Jonsson, P. (2000). Some Observations on Durations, Scheduling and Allen’s Algebra. In: Dechter, R. (eds) Principles and Practice of Constraint Programming – CP 2000. CP 2000. Lecture Notes in Computer Science, vol 1894. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45349-0_35

Download citation

  • DOI: https://doi.org/10.1007/3-540-45349-0_35

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41053-9

  • Online ISBN: 978-3-540-45349-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation