Branching allen reasoning with intervals in branching time

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3343, Issue , 2005, Pages 323-343

  Ragni, Marco ^a   Wölfl, Stefan ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; PLANNING;

PLANNING TASKS; SPATIAL REASONING; TEMPORAL REASONING;

ARTIFICIAL INTELLIGENCE;

EID: 26444566270     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-32255-9_19     Document Type: Conference Paper

References (35)

1. J. Allen and P. Hayes. A common-sense theory of time. In Proceedings of the 9th International Joint Conference on Artificial Intelligence (IJCAI-85), pages 528-531, Los Angeles, CA, USA, 1985.
2. J. F. Allen. Maintaining knowledge about temporal intervals. Communications of the ACM, 26(11):832-843, 1983.
3. Reprinted in D. S. Weld and J. de Kleer, editors, Readings in Qualitative Reasoning about Physical Systems, pages 361-372. Kaufmann, San Mateo, CA, 1990.
4. R. Alur, T. A. Henzinger, and O. Kupferman. Alternating-time temporal logic. In Proceedings of the 38th Symposium on Foundations of Computer Science, 1997.
5. F. Anger, P. Ladkin, and R. Rodriguez. Atomic temporal interval relations in branching time: Calculation and application. In Actes 9th SPIE Conference on Applications of Artificial Conference, Orlando, FL, USA, 1991.
6. B. Bennett, A. Isli, and A. G. Cohn. When does a composition table provide a complete and tractable proof procedure for a relational constraint language? In Proceedings of the IJCAI97 Workshop on Spatial and Temporal Reasonin, 1997.
7. M. Broxvall. The point algebra for branching time revisited. In Proceedings of the Joint German/Austrian Conference on Artificial Intelligence (KI-2001), pages 106-121, 2001.
8. 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 (CP-99), pages 129-143, 1999.
9. T. Drakengren and P. Jonsson. A complete classification of tractability in Allen's algebra relative to subsets of basic relations. Artificial Intelligence, 106(2):205-219, 1998.
10. I. Düntsch, H. Wang, and S. McCloskey. Relation algebras in qualitative spatial reasoning. Fundamenta Informatiae, 39(3):229-249, 1999.
11. E. A. Emerson and J. Srinivasan. Branching time temporal logic. In Proceedings of REX Workshop 1988, 1988.
12. J. Euzenat. Algèbres d'intervalles sur des domaines temporels arborescents. In Actes 11ième RFIA, Clermont-Ferrand, 1998.
13. C. Freksa. Conceptual neighborhood and its role in temporal and spatial reasoning. In Decision Support Systems and Qualitative Reasoning, pages 181-187. North-Holland, Amsterdam, 1991.
14. C. Freksa. Temporal reasoning based on semi-intervals. Artificial Intelligence, 54:199-227, 1992.
15. P. J. Hayes. The naive physics manifesto. In D. Michie, editor, Expert Systems in the MicroElectronic Age. Edinburgh University Press, 1978.
16. P. J. Hayes and J. F. Allen. Short time periods. In Proceedings of the 10th International Joint Conference on Artificial Intelligence (IJCAI-87), 1987.
17. R. Hirsch. Relation algebras of intervals. Artificial Intelligence, 83, 1996.
18. R. Hirsch. Expressive power and complexity in algebraic logic. Journal of Logic and Computation, 7(3):309-351, 1997.
19. F. v. Kutschera. Sebastian's strolls. Grazer Philosophische Studien, 45:75-88,1993.
20. P. Ladkin. Models of axioms for time intervals. In Proceedings of AAAI-87,1987.
21. P. Ladkin. Satisfying first-order constraints about time intervals. In Proceedings of AAAI-88, pages 512-517, 1988.
22. P. B. Ladkin. Time representation: A taxonomy of interval relations. In Proceedings of AAAI-86, pages 360-366, 1986.
23. P. B. Ladkin. The completeness of a natural system for reasoning with time intervals. In Proceedings of IJCAI-87, pages 462-467, 1987.
24. P. B. Ladkin and R. D. Maddux. On binary constraint problems. Journal of the ACM, 1994.
25. G. Ligozat. A new proof of tractability for ORD-Horn relations. In Proceedings of the National Conference on Artificial Intelligence (AAAI-96), Portland, Oregon.
26. R. Moratz, J. Renz, and D. Wolter. Qualitative spatial reasoning about line segments. In 14th European Conference on Artificial Intelligence (ECAI'00), Berlin, Germany, 2000.
27. B. Nebel and H.-J. Bürckert. Reasoning about temporal relations: A maximal tractable subclass of Allen's interval algebra. Technical Report RR-93-11, Deutsches Forschungszentrum für Künstliche Intelligenz GmbH, Kaiserslautern, Germany, 1993.
28. A. Prior. Past, Present and Future. Clarendon Press, Oxford, 1967.
29. A. J. Reich. Intervals, points, and branching time. In S. D. Goodwin and H. J. Hamilton, editors, Proceedings of the TIME-94 International Workshop on Temporal Reasoning, pages 121-133, Regina, SK, Canada, 1994. University of Regina.
30. R. H. Thomason. Combinations of tense and modality. In D. M. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic: Extensions of Classical Logic, volume II, pages 135-165. D. Reidel, Dordrecht, 1984.
31. G. Valiente. Algorithms on Trees and Graphs. Springer-Verlag, Berlin, 2002.
32. J. van Benthem. The Logic of Time. Reidel, 1983.
33. J. van Benthem. Time, logic, and computation. In J. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Branching Time and Partial Order in Logics and Models for Concurrency, pages 1-49. Springer Verlag, New York, 1989.
34. M. B. Vilain, H. A. Kautz, and P. G. van Beek. Contraint 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.
35. S. Wölfl. Events in branching time. Accepted for publication by Studia Logica, 2004.