Abstract
In this paper, we consider the following form of temporal abduction: given a domain theory where each explanatory formula is augmented with a set of temporal constraints on the atoms occurring in the formula, and given a set of observed atoms, with associated temporal constraints, the goal is the generation of a temporally consistent abductive explanation of the observations. Temporal abduction is the basis of many problem solving activities such as temporal diagnosis or reasoning about actions and events. This paper presents an efficient nondeterministic algorithm for temporal abduction which exploits the STP framework [8] in order to represent temporal information. In particular, we exploited some properties of STP, proved in
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. Allen. Maintaining knowledge about temporal intervals. Communications of the ACM, 26:832–843, 1983.
V. Brusoni, L. Console, B. Pernici, and P. Terenziani. LaTeR: a general purpose manager of temporal information. In Methodologies for Intelligent Systems 8, pages 255–264. Lecture Notes in Computer Science 869, Springer Verlag, 1994.
V. Brusoni, L. Console, and P. Terenziani. On the computational complexity of querying bounds on differences constraints. Artificial Intelligence, 74(2):367–379, 1995.
V. Brusoni, L. Console, P. Terenziani, and D. Theseider Dupré. Characterizing temporal abductive diagnosis. In Proc. DX 95, Sixth Int. Workshop on Principles of Diagnosis, Goslar, 1995.
V. Brusoni, L. Console, P. Terenziani, and D. Theseider Dupré. A spectrum of definitions for temporal model-based diagnosis. Technical report, Dip. di Informatica, Università di Torino, 1997.
T. Bylander, D. Allemang, M. Tanner, and J. Josephson. The computational complexity of abduction. Artificial Intelligence, 49(1–3):25–60, 1991.
L. Console, L. Portinale, and D. Theseider Dupré. Using compiled knowledge to guide and focus abductive diagnosis. IEEE Transactions on Knowledge and Data Engineering, 8(5):690–706, 1996.
R. Dechter, I. Meiri, and J. Pearl. Temporal constraint networks. Artificial Intelligence, 49:61–95, 1991.
W. Hamscher and R. Davis. Diagnosing circuit with state: an inherently underconstrained problem. In Proc. AAAI 84, pages 142–147, 1984.
W. Long. Reasoning about state from causation and time in a medical domain. In Proc AAAI 83, pages 251–254, Washington, 1983.
W. Nejdl and J. Gamper. Harnessing the power of temporal abstractions in model-based diagnosis of dynamic systems. In Proc. 11th ECAI, pages 667–671, 1994.
D. Poole. Explanation and prediction: An architecture for default and abductive reasoning. Computational Intelligence, 5(2):97–110, 1989.
P. VanBeek. Temporal query processing with indefinite information. Artificial Intelligence in Medicine, 3:325–339, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brusoni, V., Console, L., Terenziani, P., Dupré, D.T. (1997). An efficient algorithm for temporal abduction. In: Lenzerini, M. (eds) AI*IA 97: Advances in Artificial Intelligence. AI*IA 1997. Lecture Notes in Computer Science, vol 1321. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63576-9_108
Download citation
DOI: https://doi.org/10.1007/3-540-63576-9_108
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63576-5
Online ISBN: 978-3-540-69601-8
eBook Packages: Springer Book Archive