The Community for Technology Leaders
Temporal Representation and Reasoning, International Syposium on (1997)
Daytona Beach, FL
May 10, 1997 to May 11, 1997
ISBN: 0-8186-7937-9
pp: 28
Vittorio Brusoni , Dipartimento di Informatica, Universita' di Torino
Luca Console , Dipartimento di Informatica, Universita' di Torino
Paolo Terenziani , Dipartimento di Informatica, Universita' di Torino
Daniele Theseider Dupre , Dipartimento di Informatica, Universita' di Torino
ABSTRACT
In the paper, we consider the following form of temporal abduction: - given a domain theory where each formula is augmented with a set of temporal constraints on the atoms occurring in the formula, - given a set of observed atoms, with associated temporal constraints, generating an abductive explanation of the observations which is temporally consistent. Temporal abduction is the basis of many problem solving activities such as temporal diagnosis or planning with temporal constraints. The paper presents an efficient nondeterministic algorithm for temporal abduction which exploits the STP framework in order to represent temporal information. In particular, we considered some properties of STP which allow us to efficiently prune temporally inconsistent candidate explanations as soon as possible. The paper discusses the properties of the algorithm, providing an experimental evaluation of its performance.
INDEX TERMS
CITATION

P. Terenziani, D. T. Dupre, L. Console and V. Brusoni, "An Efficient Algorithm for Temporal Abduction," Temporal Representation and Reasoning, International Syposium on(TIME), Daytona Beach, FL, 1997, pp. 28.
doi:10.1109/TIME.1997.600778
158 ms
(Ver 3.3 (11022016))