Probabilistic diagnosis as an update problem

  • Angelo C. Restificar
Reasoning with Changing and Incomplete Information
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1359)


Incompleteness is addressed by using a framework that allows expression of probability. An update procedure is given to handle nonmonotonic change of knowledge. We point out the relationship between probabilistic diagnosis and probabilistic deductive database updates, and present a coincidence theorem which formally establishes it. An implication of the result allows us to treat diagnostic problems naturally within a probabilistic deductive database framework using the same procedure to insert and diagnose.


Logic Program Diagnostic Problem Basic Formula Derivation Tree Annotation Term 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Tom Bylander, Dean Allemang, Michael C. Tanner and John R. Josephson, The computational complexity of abduction. Artificial Intelligence, 49, 1991, pp. 25–60.zbMATHMathSciNetCrossRefGoogle Scholar
  2. 2.
    Console, L., Theseider Dupre, D., and Torasso, P.. A Theory of Diagnosis for Incomplete Causal Models in: Proceedings of the 11 th International Joint Conference in Artificial Intelligence, 1989, pp. 1311–1317.Google Scholar
  3. 3.
    Hendrik Decker. Drawing Updates From Derivations in: Proceedings of the International Conference on Database Theory, 1990, pp. 437–451.Google Scholar
  4. 4.
    R. Fagin, G.M. Kuper, J.D. Ullman, M.Y. Vardi. Updating Logical Databases. Advances in Computing Research, Vol. 3, JAI Press, 1986.Google Scholar
  5. 5.
    A. Guessoum and J. W. Lloyd. Updating Knowledge Bases II. TR-90-13, Univ. Bristol, Comp. Sc., 1990.Google Scholar
  6. 6.
    A.C. Kakas and P. Mancarella. Database Updates through Abduction in: Proceedings of the 16 th International Conference on Very Large Databases, 1990, pp. 650–661.Google Scholar
  7. 7.
    Michael Kifer and V.S. Subrahmanian. Theory of Generalized Annotated Logic Programming and its Applications. J. ofLogic Programming, Vol. 12, 1992, pp. 335–367.MathSciNetCrossRefGoogle Scholar
  8. 8.
    Raymond T. Ng and V.S. Subrahmanian. A Semantical Framework for Supporting Subjective and Conditional Probabilities in Deductive Databases in: Proceedings of the 8th International Conference in Logic Programming, 1991, pp. 565–580.Google Scholar
  9. 9.
    L. Ngo and P. Haddawy. Probabilistic Logic Programming and Bayesian Network in: Proceedings of the 1995 Asian Computing Science Conference, 1995, pp. 286–300.Google Scholar
  10. 10.
    N. Nilsson. Probabilistic Logic. Artificial Intelligence, 28, pp. 71–87.Google Scholar
  11. 11.
    D. Poole. Logic Programming, Abduction and Probability in: Proceedings of the International Conference on Fifth Generation Computer Systems, 1992, pp. 530–538Google Scholar
  12. 12.
    A. Restificar. An Update Procedure for A Probabilistic Deductive Database in: Proceedings of the 4 th Pacific Rim International Conference on Artificial Intelligence, 1996, pp. 144–156.Google Scholar
  13. 13.
    Anthony Tomasic. A View Update Translation via Deduction and Annotation in: Proceedings of the 2 nd International Conference on Database Theory, 1988, pp. 338–352.Google Scholar
  14. 14.
    K. Inoue and C. Sakama. Abductive Framework for Nonmonotonic Theory Change in: Proceedings of the 14 th International Joint Conference in Artificial Intelligence, 1995, pp. 204–210.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Angelo C. Restificar
    • 1
  1. 1.Department of Computer ScienceAssumption UniversityHuamark, BangkokThailand

Personalised recommendations