A logic-based calculus of events
New Generation Computing
Planning for conjunctive goals
Artificial Intelligence
Reasoning about partially ordered events
Artificial Intelligence
An improved algorithm for transitive closure on acyclic digraphs
Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
Introduction to algorithms
Handbook of theoretical computer science (vol. A)
Database updates in the event calculus
Journal of Logic Programming
On the computational complexity of temporal projection, planning, and plan validation
Artificial Intelligence
Event choice datalog: a logic programming language for reasoning in multiple dimensions
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
| Hi-index | 0.00 |
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. To overcome the computational weakness of the traditional generate-and-test algorithm of (Modal) Event Calculus, we propose two alternative graph-traversal algorithms that operate on the underlying directed acyclic graph of events representing ordering information. The first algorithm pairs breadth-first and depth-first visits of such an event graph in a suitable way, while the second one operates on its transitive closure and reduction. We prove the soundness and completeness of both algorithms, and thoroughly analyze and compare their computational complexity.