Abstract
In this paper, we show how well-known graph-theoretic techniques can be successfully exploited to efficiently reason about partially ordered events in Kowalski and Sergot’s Event Calculus and in its skeptical and credulous modal variants. We replace the traditional generate-and-test strategy of (Modal) Event Calculus by a generate-only strategy that operates on the transitive closure and reduction of the underlying directed acyclic graph of events. We prove the soundness and completeness of the proposed strategy, and thoroughly analyze its computational complexity.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
I. Cervesato and A. Montanari. A general modal framework for the event calculus and its skeptical and credulous variants. Journal of Logic Programming, 38(2):111–164, 1999.
D. Chapman. Planning for conjunctive goals. Artificial Intelligence, 32:333–377, 1987.
L. Chittaro, A. Montanari, and I. Cervesato. Speeding up temporal reasoning by exploiting the notion of kernel of an ordering relation. In Proc. of the 2nd International Workshop on Temporal Representation and Reasoning — TIME’95, pages 73–80, Melbourne Beach, FL, 26 April 1995.
T. Dean and M. Boddy. Reasoning about partially ordered events. Artificial Intelligence, 36:375–399, 1988.
A. Goralcikova and V. Koubek. A reduct and closure algorithm for graphs. In Proc. of the 8th Symposium on Mathematical Foundations of Computer Science. LNCS 74, pages 301–307, Olomouc, CZ, 1979. Springer.
R. Kowalski. Database updates in the event calculus. Journal of Logic Programming, 12:121–146, 1992.
R. Kowalski and M. Sergot. A logic-based calculus of events. New Generation Computing, 4:67–95, 1986.
B. Nebel and C. Bäckström. On the computational complexity of temporal projection, planning, and plan validation. Artificial Intelligence, 66:125–160, 1994.
K. Simon. An improved algorithm for transitive closure on acyclic digraphs. Theoretical Computer Science, 58(1–3):325–346, 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Franceschet, M., Montanari, A. (2000). Pairing Transitive Closure and Reduction to Efficiently Reason about Partially Ordered Events. In: Lamma, E., Mello, P. (eds) AI*IA 99: Advances in Artificial Intelligence. AI*IA 1999. Lecture Notes in Computer Science(), vol 1792. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46238-4_12
Download citation
DOI: https://doi.org/10.1007/3-540-46238-4_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67350-7
Online ISBN: 978-3-540-46238-5
eBook Packages: Springer Book Archive