Skip to main content

An update procedure for a probabilistic deductive database

  • Reasoning about Chang
  • Conference paper
  • First Online:
PRICAI'96: Topics in Artificial Intelligence (PRICAI 1996)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1114))

Included in the following conference series:

Abstract

A sound and complete view update procedure for a probabilistic deductive database is formulated using SLDp derivation trees introduced by Ng & Subrahmanian in [9]. In order to reduce the number of valid translations that can satisfy an update request a preference criteria is proposed. Moreover, we introduce a method called Δ-factor to minimize the change effected by updates in the database.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Tom Bylander, Dean Allemang, Michael C. Tanner and John R. Josephson: The computational complexity of abduction, Artificial Intelligence, Vol. 49, 1991.

    Google Scholar 

  2. Hendrik Decker: Drawing Updates From Derivations, in Proceedings of the International Conference on Database Theory, 1990.

    Google Scholar 

  3. M. H. van Emden: Quantitative Deduction and its Fixpoint Theory, Journal of Logic Programming, Elsevier Science Publishing Co., 1986.

    Google Scholar 

  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. A. Guessoum and J. W. Lloyd: Updating Knowledge Bases II, TR-90-13, Univ. Bristol, Comp. Sc., 1990.

    Google Scholar 

  6. Michael Kifer and V.S. Subrahmanian: Theory of Generalized Annotated Logic Programming and its Applications, Journal of Logic Programming, 1992.

    Google Scholar 

  7. T. Kakas and P. Mancarella: Database Updates through Abduction, Research Report, Dept. of Computing, Imperial College of Science and Technology, London, 1990.

    Google Scholar 

  8. Hector J. Levesque: A Knowledge-level Account of Abduction, in Proceedings of 11th International Joint Conference in Artificial Intelligence, Detroit, 1989.

    Google Scholar 

  9. 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.

    Google Scholar 

  10. N. Nilsson: Probabilistic Logic, AI Journal 28, pp. 71–87.

    Google Scholar 

  11. Raymond Reiter: Nonmonotonic Reasoning, Annual Review of Computer Science, Vol. 2, Annual Reviews Inc., 1987.

    Google Scholar 

  12. E. Shapiro: Logic Programs with Uncertainties: A Tool for Implementing Expert Systems, in Proceedings of the International Joint Conference in Artificial Intelligence, William Kauffman, 1983.

    Google Scholar 

  13. Anthony Tomasic: A View Update Translation via Deduction and Annotation, in Proceedings of the 2nd International Conference on Database Theory, August 31–September 2, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Norman Foo Randy Goebel

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Restificar, A.C. (1996). An update procedure for a probabilistic deductive database. In: Foo, N., Goebel, R. (eds) PRICAI'96: Topics in Artificial Intelligence. PRICAI 1996. Lecture Notes in Computer Science, vol 1114. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61532-6_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-61532-6_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61532-3

  • Online ISBN: 978-3-540-68729-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics