Summary: Temporal reasoning about composite and/or periodic events
PAOLO TERENZIANI*, LUCA ANSELMA
Dipartimento di Informatica, Universitą del Piemonte Orientale `Amedeo Avogadro', via
Bellini 25/g, Alessandria, Italy. Phone: +39 0131 360174 Fax: +39 0131 360198 Email:
Dipartimento di Informatica, Universitą di Torino, Corso Svizzera 185, 10149 Torino, Italy.
Phone: +39 011 6706821 Fax: +39 011 751603 Email: email@example.com
In many application areas, including planning, workflow, guideline and protocol management, the
description of the domain involves composite and/or periodic events, mutually related by temporal
constraints on the execution order. Such events represent `classes', since they can be instantiated
to specific executions of the plan, guideline etc., and each execution must `respect' the temporal
constraints imposed on the corresponding classes. The main objective of our work is that of
proposing an approach dealing with the above-mentioned temporal phenomena. To achieve such
an objective, we propose a tractable domain-independent temporal reasoner. This enhances the
generality of our approach, which provides a domain-independent module which can be integrated
with other software tools to solve temporal problems in specific domains.
From the methodological point of view, we first devise a representation formalism coping with
the aforesaid phenomena, and then we describe temporal constraint propagation algorithms to deal
with constraint inheritance and to perform temporal consistency checking. The representation
formalism has been designed carefully, to obtain algorithms that are both complete and tractable.