The point algebra for branching time revisited

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2174, Issue , 2001, Pages 106-121

  Broxvall, Mathias ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

BRANCHING TIME; NON-LINEAR MODEL; PATH CONSISTENCY; POINT ALGEBRAS; SATISFIABILITY; TEMPORAL REASONING; TIME COMPLEXITY;

ALGEBRA;

EID: 84974707537     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45422-5_9     Document Type: Conference Paper

References (15)

1. J. F. Allen. Maintaining knowledge about temporal intervals. Communications of the ACM, 26(11):832-843, 1983.
2. S. Baase. Computer Algorithms: Introduction to Design and Analysis. Addison Wesley, Reading, MA, 2nd edition, 1988.
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.
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.
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.
6. D. Cohen, P. Jeavons, P. Jonsson, and M. Koubarakis. Building tractable disjunctive constraints. Journal of the ACM, 47(5):826-853, 2000.
7. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Symbolic Computation, 9(3):251-280, 1990.
8. I. Düntsch, H. Wang, and S. McCloskey. Relations algebras in qualitative spatial reasoning. Fundamenta Informaticae, 39(3):229-248, 1999.
9. E. A. Emerson and J. Srinivasan. Branching time temporal logic. In Proceedings of REX Workshop 1988, pages 123-172, 1988.
10. M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York, 1979.
11. R. Hirsch. Expressive power and complexity in algebraic logic. Journal of Logic and Computation, 7(3):309-351, 1997.
12. D. McDermott. A temporal logic for reasoning about processes and plans. Cognitive Science, 6:101-155, 1982.
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.
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.
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.