Representing Continuous Change in the Abductive Event Calculus

In this paper we extend the Abductive Event Calculus, a variant and extension of the Event Calculus of Kowalski and Sergot, with a representation for continuous change. We assume the change is not exactly known and use constraints to represent the available knowledge. The resulting logic program can be executed by the SLDNFA abductive procedure of Denecker and De Schreye. We show how our representation of continuous change combines with solutions to other problems in temporal reasoning, like indeterministic eeects of actions, and how it can be used not only for temporal projection, but also to solve planning and diagnosis problems or any combination thereof.