Abstract
Time representation is important in many applications, such as temporal databases, planning, and multi-agents. Since Allen’s work on binary interval relations (called interval algebra), many researchers have further investigated temporal information processing based on interval calculus. However, there are still some limitations, e.g. constraint satisfaction is a NP-hard problem in interval calculus. For this reason, we propose a new interpretation for interval relationships and their calculus in this paper, which establishes a new method to transform interval calculus into matrix calculus. Our experiments show that this method propagates temporal relations faster than interval algebra.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
J. Allen. Maintaining knowledge about temporal intervals, Commun. A CM 26(11), 832–843, 1983.
H. Barringer, R. Kuiper, A. Pnueli. Now you may compose temporal logic specifications. In: Proc. 16th ACM Symposium on Theory of Computing, ACM, New York, 1984, pp. 51–63.
S. Kraus, J. Wilkenfeld, G. Zlotkin. Multiagent negotiation under time constraints, Artificial Intelligence 75, 297–345, 1995.
D. McDermott. A temporal logic for reasoning about processes and plans, Cognitive Science 6, 101–155, 1982.
E. Schwalb, L. Vila. Logic programming with temporal constraints. In: Proc. International Workshop on Temporal Representation and Reasoning, 1996, pp. 51–56.
R. Snodgrass. The temporal query language TQuel, ACM Trans. Database Systems 12(2), 247–298, 1987.
C. Stuart. An implementation of a multiagent plan synchronizer using a temporal logic theorem prover, Proc. IJCAI-85, 1985, pp. 1031–1033.
A. Tuzhilin. Extending temporal logic to support high-level simulations, ACM Trans. Modeling and Computer Simulation 5(2), 129–155, 1995.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zhang, S., Zhang, C. IMC: A Method for Interval Calculus in Matrix. Knowledge and Information Systems 1, 257–268 (1999). https://doi.org/10.1007/BF03325100
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF03325100