Abstract
As systems become increasingly complex, event abstraction becomes an important issue in order to represent interactions and reason at the right level of abstraction. Abstract events are collections of more elementary events, that provide a view of the system execution at an appropriate level of granularity. Understanding how two abstract events relate to each other is a fundamental problem for knowledge representation and reasoning in a complex system. In this paper, we study how two abstract events in a distributed system are related to each other in terms of the more elementary causality relation. Specifically, we analyze the ways in which two abstract events can be related to each other orthogonally, that is, identify all the possible mutually independent relations by which two such events could be related to each other. Such an analysis is important because all possible relationships between two abstract events that can exist in the face of uncertain knowledge can be expressed in terms of the irreducible orthogonal relationships.
This is a preview of subscription content, log in via an institution to check access.
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
M. Aigner, Combinatorial Theory, Springer-Verlag, 1979.
J. Allen, Maintaining knowledge about temporal intervals, Communications of the ACM, 26(11):832–843, 1983.
J. Allen, Towards a general theory of action and time, Artificial Intelligence, 23:123–154, 1984.
P. van Beek, Reasoning about qualitative temporal information, Artificial Intelligence, 58:297–326, 1992.
P. van Beek, R. Cohen, Exact and approximate reasoning about temporal relations, Computational Intelligence, 6:132–144, 1990.
J. van Benthem, The Logic of Time, Kluwer Academic Publishers, (1ed. 1983), 2ed. 1991.
C. Brink, Power structures, Algebra Universalis, Vol. 30, 177–216, 1993.
C. Freksa, Temporal reasoning based on semi-intervals, Artificial Intelligence, 54: 199–227, 1992.
A. Gerevini, L. Schubert, Efficient algorithms for qualitative reasoning about time, Artificial Intelligence, 74: 207–248, 1995.
C. L. Hamblin, Instants and intervals, In The Study of Time, pp. 324–332, Springer-Verlag, 1972.
A. Kshemkalyani, Temporal interactions of intervals in distributed systems, Journal of Computer and System Sciences, 52(2), 287–298, April 1996.
A. Kshemkalyani, Reasoning about causality between distributed nonatomic events, Artificial Intelligence, 92(2): 301–315, May 1997.
L. Lamport, On interprocess communication, Part I: Basic formalism, Distributed Computing, 1:77–85, 1986.
B. Nebel, H.-J. Buerckert, Reasoning about temporal relations: A maximal tractable subclass of Allen’s interval algebra, Journal of the ACM, 42(1): 43–66, Jan. 1995.
R. Rodriguez, F. Anger, K. Ford, Temporal reasoning: a relativistic model, International Journal of Intelligent Systems, 11: 237–254, 1991.
P. Terenziani, P. Torasso, Time, action-types, and causation, Computational Intelligence, 11(3):529–552, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kshemkalyani, A., Kamath, R. (2001). Orthogonal Relations for Reasoning about Abstract Events. In: Benferhat, S., Besnard, P. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2001. Lecture Notes in Computer Science(), vol 2143. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44652-4_64
Download citation
DOI: https://doi.org/10.1007/3-540-44652-4_64
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42464-2
Online ISBN: 978-3-540-44652-1
eBook Packages: Springer Book Archive