This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Local Reasoning and Knowledge Compilation for Efficient Temporal Abduction
November/December 2002 (vol. 14 no. 6)
pp. 1230-1248

Abstract—Generating abductive explanations is the basis of several problem solving activities such as diagnosis, planning, and interpretation. Temporal abduction means generating explanations that do not only account for the presence of observations, but also for temporal information on them, based on temporal knowledge in the domain theory. We focus on the case where such a theory contains temporal constraints that are required to be consistent with temporal information on observations. The aim of this paper is to propose efficient algorithms for computing temporal abductive explanations. Temporal constraints in the theory and in the observations can be used actively by an abductive reasoner in order to prune inconsistent candidate explanations at an early stage during their generation. However, checking temporal constraint satisfaction frequently generates some overhead. In the paper, we analyze two incremental ways of making this process efficient. First we show how, using a specific class of temporal constraints (which is expressive enough for many applications), such an overhead can be reduced significantly, yet preserving a full pruning power. In general, the approach does not affect the asymptotic complexity of the problem, but it provides significant advantages in practical cases. We also show that, for some special classes of theories, the asymptotic complexity is also reduced. We then show how, compiled knowledge based on temporal information, can be used to further improve the computation, thus, extending to the temporal framework previous results in the case of atemporal abduction. The paper provides both analytic and experimental evaluations of the computational advantages provided by our approaches.

[1] J.F. Allen, “Maintaining Knowledge about Temporal Intervals,” Comm. ACM, vol. 26, no. 11, pp. 832–843, 1983.
[2] R. Arthur and J. Stillman, “Temporal Reasoning for Planning and Scheduling,” technical report, AI Lab, General Electric Research Center, 1992.
[3] V. Brusoni, L. Console, B. Pernici, and P. Terenziani, “LaTeR: A General Purpose Manager of Temporal Information,” Methodologies for Intelligent Systems, pp. 255–264, vol. 8,Lecture Notes in Computer Science, Springer Verlag, vol. 869, 1994.
[4] V. Brusoni, L. Console, B. Pernici, and P. Terenziani, “LaTeR: An Efficient, General-Purpose Manager of Temporal Information,” IEEE Expert, vol. 12, no. 4, pp. 56-64, 1997.
[5] V. Brusoni, L. Console, and P. Terenziani, “On the Computational Complexity of Querying Bounds on Differences Constraints,” Artificial Intelligence, vol. 74, no. 2, pp. 367-379, 1995.
[6] V. Brusoni, L. Console, P. Terenziani, and D. Theseider Dupré, “A Spectrum of Definitions for Temporal Model-Based Diagnosis,” Artificial Intelligence, vol. 102, no. 1, pp. 39-79, 1998.
[7] T. Bylander, “When Efficient Assembly Performs Correct Abduction and Why Abduction Is Otherwise Trivial or Intractable,” Proc. AAAI Symp. Automated Abduction, pp. 86-90, 1990.
[8] T. Bylander, D. Allemang, M.C. Tanner, and J.R. Josephson, “The Computational Complexity of Abduction,” Artificial Intelligence, vol. 49, pp. 25–60, 1991.
[9] M. Cadoli and F.M. Donini, “A Survey on Knowledge Compilation,” Artificial Intelligence Comm., 1997.
[10] E. Charniak, “Motivation Analysis, Abductive Unification, and Nonmonotonic Equality,” Artificial Intelligence, vol. 34, no. 3, pp. 275-295, 1988.
[11] N. Chleq, “Efficient Algorithms for Networks of Quantitative Temporal Constraints,” Proc. CONSTRAINTS '95, 1995.
[12] L. Console, L. Portinale, and D. Theseider Dupré, “Using Compiled Knowledge to Guide and Focus Abductive Diagnosis,” IEEE Trans. Knowledge and Data Eng., vol. 8, no. 5, pp. 690-706, 1996.
[13] L. Console and P. Terenziani, “Efficient Processing of Queries and Assertions about Qualitative and Quantitative Temporal Constraints,” Computational Intelligence, vol. 15, no. 4, pp. 442-465, 1999.
[14] L. Console, D. Theseider Dupré, and P. Torasso, “On the Relationship between Abduction and Deduction,” J. Logic and Computation, vol. 1, no. 5, pp. 661-690, 1991.
[15] L. Console and P. Torasso, "A Spectrum of Logical Definitions of Model-Based Diagnosis," Computational Intelligence, vol. 7, no. 3, pp. 133-141, 1991.
[16] L. Console and P. Torasso, "An Approach to the Compilation of Operational Knowledge From Causal Models," IEEE Trans. Systems, Man, and Cybernetics, vol. 22, no. 4, pp. 772-789, 1992.
[17] P. T. Cox and T. Pietrzykowski, “General Diagnosis by Abductive Inference,” Proc. IEEE Symp. Logic Programming, pp. 183-189, 1987.
[18] J. de Kleer and B. Williams, "Diagnosing Multiple Faults," Artificial Intelligence, vol. 32, pp. 97-130, Elsevier, 1987.
[19] R. Dechter, I. Meiri, and J. Pearl, “Temporal Constraint Networks,” Artificial Intelligence, vol. 49, pp. 61–95, 1991.
[20] O. Dressler and P. Struss, “Model-Based Diagnosis with the Default-Based Diagnosis Engine: Effective Control Strategies that Work in Practice,” Proc. 11th European Conf. Artificial Intelligence, pp. 677-681, 1994.
[21] T. Eiter and G. Gottlob, "The Complexity of Logic-Based Abduction," J. ACM, vol. 42, no. 1, pp. 3-42, Jan. 1995.
[22] K. Eshghi, “Abductive Planning with Event Calculus,” Proc. Fifth Int. Conf. and Symp. Logic Programming, pp. 562-579, 1988.
[23] K. Eshghi, “A Tractable Class of Abduction Problems,” Proc. 13th Int'l Joint Conf. Artificial Intelligence, pp. 3-8, 1993.
[24] G. Friedrich and W. Nejdl, “MOMO—Model-Based Diagnosis for Everybody,” Proc. IEEE Conf. Artificial Intelligence Applications (CAIA), Mar. 1990. a slightly revised and extended version appears in Readings in Model-Based Diagnosis.
[25] J. Gamper and W. Nejdl, “Abstract Temporal Diagnosis in Medical Domains,” Artificial Intelligence in Medicine, vol. 10, no. 3, pp. 209-234, 1997.
[26] J.R. Hobbs, M. Stickel, P. Martin, and D. Edwards, “Interpretation as Abduction,” Proc. 26th Ann. ACL Meeting, pp. 95-103, 1988.
[27] A.C. Kakas, R.A. Kowalski, and F. Toni, “Abductive Logic Programming,” J. Logic and Computation, vol. 2, no. 6, pp. 719-770, 1992.
[28] K. Konolige, “Abduction Versus Closure in Causal Theories,” Artificial Intelligence, vol. 53, nos. 2-3, pp. 255-272, 1992.
[29] H.J. Levesque, “A Knowledge-Level Account of Abduction,” Proc. 11th Int'l Joint Conf. Artificial Intelligence, Detroit, pp. 1061-1067, 1989.
[30] W. Long, “Reasoning About State from Causation and Time in a Medical Domain,” Proc. Am. Assoc. for Artificial Intelligence '83, pp. 251-254, 1983.
[31] W. Long, “Temporal Reasoning for Diagnosis in a Causal Probabilistic Knowledge Base,” Artificial Intelligence in Medicine, vol. 8, no. 3, pp. 193-216, 1996.
[32] I. Meiri, “Combining Qualitative and Quantitative Constraints in Temporal Reasoning,” Proc. Am. Assoc. for Artificial Intelligence '91, pp. 260-267, 1991.
[33] W. Nejdl and J. Gamper, “Harnessing the Power of Temporal Abstractions in Model-Based Diagnosis of Dynamic Systems,” Proc. 11th European Conf. Artificial Intelligence, pp. 667-671, 1994.
[34] Y. Peng and J.A. Reggia, Abductive Inference Models for Diagnostic Problem-Solving, Springer-Verlag, New York, 1990.
[35] D. Poole, "Explanation and Deduction: An Architecture for Default and Abductive Reasoning," Computational Intelligence, vol. 5, pp. 97-110, 1989.
[36] D. Poole, “Normality and Faults in Logic-Based Diagnosis,” Proc. 11th Int'l Joint Conf. Artificial Intelligence, pp. 1304-1310, 1989.
[37] D. Poole, R. Goebel, and R. Aleliunas, “THEORIST: A Logical Reasoning System for Defaults and Diagnosis,” The Knowledge Frontier, N. Cercone and G. Mc Calla, eds., pp. 331-352, Springer-Verlag, 1987.
[38] H. Pople, “Heuristic Methods for Imposing Structure on Ill-Structured Problems: The Structuring of Medical Knowledge,” Artificial Intelligence in Medicine, P. Szolovits, ed., pp. 119-190, Westview Press, 1982.
[39] M. Porcheron, B. Ricard, J.-L. Busquet, and P. Parent, “DIAPO: A Case Study in Applying Advanced AI Techniques to the Diagnosis of a Complex System,” Proc. 11th European Conf. Artificial Intelligence, pp. 43-47, 1994.
[40] M. Shanahan, “Prediction is Deduction but Explanation is Abduction.” Proc. 11th Int'l Joint Conf. Artificial Intelligence, pp. 1055-1060, 1989.
[41] P. VanBeek, “Temporal Query Processing with Indefinite Information,” Artificial Intelligence in Medicine, vol. 3, pp. 325-339, 1991.
[42] M. Vilain and H. Kautz, “Constraint Propagation Algorithms for Temporal Reasoning,” Proc. Am. Assoc. for Artificial Intelligence '86, pp. 377-382, 1986.
[43] M. Vilain, H. Kautz, and P. VanBeek, “Constraint Propagation Algorithms for Temporal Reasoning: A Revised Report,” D.S. Weld and J. de Kleer, eds., Readings in Qualitative Reasoning About Physical Systems, pp. 373–381, Morgan Kaufmann, 1989.

Index Terms:
Abductive reasoning, temporal reasoning, computing explanations, efficient algorithms, knowledge-based systems, knowledge compilation.
Citation:
Luca Console, Paolo Terenziani, Daniele Theseider Dupré, "Local Reasoning and Knowledge Compilation for Efficient Temporal Abduction," IEEE Transactions on Knowledge and Data Engineering, vol. 14, no. 6, pp. 1230-1248, Nov.-Dec. 2002, doi:10.1109/TKDE.2002.1047764
Usage of this product signifies your acceptance of the Terms of Use.