The Logical Approach to Temporal Reasoning
Artificial Intelligence Review
Temporal representation and reasoning in artificial intelligence: Issues and approaches
Annals of Mathematics and Artificial Intelligence
Some Alternative Formulations of the Event Calculus
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
Understanding and Simulating Narratives in the Context of Information Systems
ER '02 Proceedings of the 21st International Conference on Conceptual Modeling
Operational Characterization of Genre in Literary and Real-life Domains
ER '99 Proceedings of the 18th International Conference on Conceptual Modeling
Simulating the Intertaction of Database Agents
DEXA '99 Proceedings of the 10th International Conference on Database and Expert Systems Applications
Modeling interactive storytelling genres as application domains
Journal of Intelligent Information Systems
| Hi-index | 0.00 |
Kowalski and Sergot's (1986) event calculus (EC) is a simple temporal formalism that, given a set of event occurrences, allows the derivation of the maximal validity intervals (MVIs) over which properties initiated or terminated by those events hold. The limited expressive power of EC is notably augmented by permitting events to initiate or terminate a property only if a given set of preconditions hold at their occurrence time. We define a semantic formalization of the event calculus with preconditions. We gain further expressiveness by considering modal variants of this formalism, and show how to adapt our semantic characterization to encompass the additional operators. We discuss the complexity of MVI validation and describe examples showing that modal event calculi with preconditions can be successfully exploited to deal with real-world applications.