Skip to main content
SpringerLink
Log in

The Point Algebra for Branching Time Revisited

  • Conference paper
  • First Online:
KI 2001: Advances in Artificial Intelligence (KI 2001)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2174))

Included in the following conference series:

Abstract

Temporal reasoning with nonlinear models of time have been used in many areas of artificial intelligence. In this paper we focus on the model of branching time which has been proven successful for problems such as planning. We investigate the computational complexity of the point algebra for branching time extended with disjunctions and show that there are exactly five maximal tractable sets of relations. We also give an improved algorithm for deciding satisfiability of the point algebra with a time complexity comparable to that of path consistency checking algorithms.

This research has been supported by the ECSEL graduate student program.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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.

Reference

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

    Article  MATH  Google Scholar 

  2. S. Baase. Computer Algorithms: Introduction to Design and Analysis. Addison Wesley, Reading, MA, 2nd edition, 1988.

    Google Scholar 

  3. M. Broxvall and P. Jonsson. Towards a complete classification of tractability in point algebras for nonlinear time. In Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming, pages 129–143, 1999.

    Google Scholar 

  4. M. Broxvall and P. Jonsson. Disjunctive temporal reasoning in partially ordered time structures. In Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI-2000), pages 464–469. AAAI Press, 2000.

    Google Scholar 

  5. M. Broxvall, P. Jonsson, and J. Renz. Refinements and independence: A simple method for identifying tractable disjunctive constraints. In Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming, pages 114–127, 2000.

    Google Scholar 

  6. D. Cohen, P. Jeavons, P. Jonsson, and M. Koubarakis. Building tractable disjunctive constraints. Journal of the ACM, 47(5):826–853, 2000.

    Article  MathSciNet  Google Scholar 

  7. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Symbolic Computation, 9(3):251–280, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  8. I. Düntsch, H. Wang, and S. McCloskey. Relations algebras in qualitative spatial reasoning. Fundamenta Informaticae, 39(3):229–248, 1999.

    MathSciNet  Google Scholar 

  9. E. A. Emerson and J. Srinivasan. Branching time temporal logic. In Proceedings of REX Workshop 1988, pages 123–172, 1988.

    Google Scholar 

  10. M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York, 1979.

    Google Scholar 

  11. R. Hirsch. Expressive power and complexity in algebraic logic. Journal of Logic and Computation, 7(3):309–351, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  12. D. McDermott. A temporal logic for reasoning about processes and plans. Cognitive Science, 6:101–155, 1982.

    Article  Google Scholar 

  13. 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 

  14. J. Renz. Maximal tractable fragments of the region connection calculus: A complete analysis. In Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99), pages 129–143, Stockholm, Sweden, 1999.

    Google Scholar 

  15. 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 

Download references

Author information

Authors and Affiliations

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

    Mathias Broxvall

Authors
  1. Mathias Broxvall
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. RWTH Aachen, Theoretical Computer Science, Ahornstrasse 55, 52074, Aachen, Germany

    Franz Baader

  2. Intelligent Systems Department, University of Leipzig, Computer Science Institute, Augustusplatz 10-11, 04109, Leipzig, Germany

    Gerhard Brewka

  3. Institute of Information Systems Knowledge-Based Systems Group, Vienna University of Technology, Favoritenstrasse 11, 1040, Wien, Austria

    Thomas Eiter

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Broxvall, M. (2001). The Point Algebra for Branching Time Revisited. In: Baader, F., Brewka, G., Eiter, T. (eds) KI 2001: Advances in Artificial Intelligence. KI 2001. Lecture Notes in Computer Science(), vol 2174. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45422-5_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-45422-5_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42612-7

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation