Skip to main content

Anytime temporal reasoning: Preliminary report (extended abstract)

  • Posters
  • Conference paper
  • First Online:
Principles and Practice of Constraint Programming — CP96 (CP 1996)

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

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

Access this chapter

Institutional subscriptions

References

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

    Google Scholar 

  2. M. Dalal. Anytime families of tractable prepositional reasoners. In Fourth International Symposium on Artificial Intelligence and Mathematics (AI/MATH-96), pages 42–45, Florida, 1996.

    Google Scholar 

  3. D. McAllester. Truth maintenance. In Proceedings Eighth National Conference on Artificial Intelligence (AAAI-90), pages 1109–1116, 1990.

    Google Scholar 

  4. E. Mendelson. Introduction to Mathematical Logic. Van Nostrand, Princeton, N.J., 1964.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Eugene C. Freuder

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dalal, M., Feng, Y. (1996). Anytime temporal reasoning: Preliminary report (extended abstract). In: Freuder, E.C. (eds) Principles and Practice of Constraint Programming — CP96. CP 1996. Lecture Notes in Computer Science, vol 1118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61551-2_103

Download citation

  • DOI: https://doi.org/10.1007/3-540-61551-2_103

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61551-4

  • Online ISBN: 978-3-540-70620-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics