Abstract
Allen’s interval calculus is one of the most prominent formalisms in the domain of qualitative spatial and temporal reasoning. Applications of this calculus, however, are restricted to domains that deal with linear flows of time. But how the fundamental ideas of Allen’s calculus can be extended to other, weaker structures than linear orders has gained only little attention in the literature. In this paper we will investigate intervals in branching flows of time, which are of special interest for temporal reasoning, since they allow for representing indeterministic aspects of systems, scenarios, planning tasks, etc. As well, branching time models, i.e., treelike non-linear structures, do have interesting applications in the field of spatial reasoning, for example, for modeling traffic networks. In a first step we discuss interval relations for branching time, thereby comprising various sources from the literature. Then, in a second step, we present some new complexity results concerning constraint satisfaction problems of interval relations in branching time.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Allen, J., Hayes, P.: A common-sense theory of time. In: Proceedings of the 9th International Joint Conference on Artificial Intelligence (IJCAI 1985), Los Angeles, CA, USA, pp. 528–531 (1985)
Allen, J.F.: Maintaining knowledge about temporal intervals. Communications of the ACM, 26(11), 832–843 (1983) Reprinted in Weld, D.S., de Kleer, J. (eds) Readings in Qualitative Reasoning about Physical Systems, pp. 361–372. Kaufmann, San Mateo (1990)
Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. In: Proceedings of the 38th Symposium on Foundations of Computer Science (1997)
Anger, F., Ladkin, P., Rodriguez, R.: Atomic temporal interval relations in branching time: Calculation and application. In: Actes 9th SPIE Conference on Applications of Artificial Conference, Orlando, FL, USA (1991)
Bennett, B., Isli, A., Cohn, A.G.: When does a composition table provide a complete and tractable proof procedure for a relational constraint language? In: Proceedings of the IJCAI 1997 Workshop on Spatial and Temporal Reasonin (1997)
Broxvall, M.: The point algebra for branching time revisited. In: Baader, F., Brewka, G., Eiter, T. (eds.) KI 2001. LNCS (LNAI), vol. 2174, pp. 106–121. Springer, Heidelberg (2001)
Broxvall, M., Jonsson, P.: Towards a complete classification of tractability in point algebras for nonlinear time. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 129–143. Springer, Heidelberg (1999)
Drakengren, T., Jonsson, P.: A complete classification of tractability in Allen’s algebra relative to subsets of basic relations. Artificial Intelligence 106(2), 205–219 (1998)
Düntsch, I., Wang, H., McCloskey, S.: Relation algebras in qualitative spatial reasoning. Fundamenta Informatiae 39(3), 229–249 (1999)
Emerson, E.A., Srinivasan, J.: Branching time temporal logic. In: Proceedings of REX Workshop (1988)
Euzenat, J.: Algèbres d’intervalles sur des domaines temporels arborescents. In: Actes 11iéme RFIA, Clermont-Ferrand (1998)
Freksa, C.: Conceptual neighborhood and its role in temporal and spatial reasoning. In: Decision Support Systems and Qualitative Reasoning, pp. 181–187. North-Holland, Amsterdam (1991)
Freksa, C.: Temporal reasoning based on semi-intervals. Artificial Intelligence 54, 199–227 (1992)
Hayes, P.J.: The naive physics manifesto. In: Michie, D. (ed.) Expert Systems in the Micro-Electronic Age. Edinburgh University Press (1978)
Hayes, P.J., Allen, J.F.: Short time periods. In: Proceedings of the 10th International Joint Conference on Artificial Intelligence, IJCAI 1987 (1987)
Hirsch, R.: Relation algebras of intervals. Artificial Intelligence 83 (1996)
Hirsch, R.: Expressive power and complexity in algebraic logic. Journal of Logic and Computation 7(3), 309–351 (1997)
Kutschera, F.v.: Sebastian’s strolls. Grazer Philosophische Studien 45, 75–88 (1993)
Ladkin, P.: Models of axioms for time intervals. In: Proceedings of AAAI 1987 (1987)
Ladkin, P.: Satisfying first-order constraints about time intervals. In: Proceedings of AAAI 1988, pp. 512–517 (1988)
Ladkin, P.B.: Time representation: A taxonomy of interval relations. In: Proceedings of AAAI 1986, pp. 360–366 (1986)
Ladkin, P.B.: The completeness of a natural system for reasoning with time intervals. In: Proceedings of IJCAI 1987, pp. 462–467 (1987)
Ladkin, P.B., Maddux, R.D.: On binary constraint problems. Journal of the ACM (1994)
Ligozat, G.: A new proof of tractability for ORD-Horn relations. In: Proceedings of the National Conference on Artificial Intelligence (AAAI 1996), Portland, Oregon (1996)
Moratz, R., Renz, J., Wolter, D.: Qualitative spatial reasoning about line segments. In: 14th European Conference on Artificial Intelligence (ECAI 2000), Berlin, Germany (2000)
Nebel, B., Bürckert, H.-J.: 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)
Prior, A.: Past, Present and Future. Clarendon Press, Oxford (1967)
Reich, A.J.: Intervals, points, and branching time. In: Goodwin, S.D., Hamilton, H.J. (eds.) Proceedings of the TIME-94 International Workshop on Temporal Reasoning, University of Regina, Regina, SK, Canada, pp. 121–133 (1994)
Thomason, R.H.: Combinations of tense and modality. In: Gabbay, D.M., Guenthner, F. (eds.) Handbook of Philosophical Logic: Extensions of Classical Logic, vol. II, pp. 135–165. D. Reidel, Dordrecht (1984)
Valiente, G.: Algorithms on Trees and Graphs. Springer, Berlin (2002)
van Benthem, J.: The Logic of Time. Reidel (1983)
van Benthem, J.: Time, logic, and computation. In: de Bakker, J., de Roever, W.-P., Rozenberg, G. (eds.) Branching Time and Partial Order in Logics and Models for Concurrency, pp. 1–49. Springer, New York (1989)
Vilain, M.B., Kautz, H.A., van Beek, P.G.: Contraint propagation algorithms for temporal reasoning: A revised report. In: Weld, D.S., de Kleer, J. (eds.) Readings in Qualitative Reasoning about Physical Systems, pp. 373–381. Morgan Kaufmann, San Mateo (1989)
Wölfl, S.: Events in branching time. Accepted for publication by Studia Logica (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ragni, M., Wölfl, S. (2005). Branching Allen. In: Freksa, C., Knauff, M., Krieg-Brückner, B., Nebel, B., Barkowsky, T. (eds) Spatial Cognition IV. Reasoning, Action, Interaction. Spatial Cognition 2004. Lecture Notes in Computer Science(), vol 3343. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-32255-9_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-32255-9_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25048-7
Online ISBN: 978-3-540-32255-9
eBook Packages: Computer ScienceComputer Science (R0)