Skip to main content

Towards probabilistic knowledge bases

  • Session 4: Data Bases and Knowledge Bases
  • Conference paper
  • First Online:
Logic Programming and Automated Reasoning (LPAR 1992)

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

Abstract

We define a new fixpoint semantics for rule-based reasoning in the presence of vague or imprecise information. Such a semantics should fulfill two requirements. First, it must coincide with the intuitive understanding of the given information, and second, the semantics must be computationally tractable. We show that our semantics fulfills the first requirement and we formally verify that our fixpoint semantics reduces to the usual fixpoint semantics of Datalog programs if all the given information is certain or non-vague. Moreover, we rigorously prove that this new semantics also satisfies the second requirement. At the end of this study we emphasize the strong similarity between our semantics and basic probability theory.

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. F. Baader. A formal definition for the expressive power of knowledge representation languages. In L. C. Aiello, editor, European Conference on Artificial Intelligence, pages 53–58, 1990.

    Google Scholar 

  2. J. L. Balcazar, J. Diaz, and J. Gabarro. Structural Complexity, volume I. Springer-Verlag, 1988.

    Google Scholar 

  3. D. Barbara, H. Garcia-Molina, and D. Porter. A probabilistic relational data model. In F. Bancilhon, C. Thanos, and D. Tsichritzis, editors, Advances in Database Technology (EDBT 90), pages 60–74, 1990.

    Google Scholar 

  4. P. Cheeseman. Probabilistic vs. fuzzy reasoning. In L. N. Kanal and J. F. Lemmer, editors, Uncertainty in Artificial Intelligence, pages 85–102. North-Holland, 1986.

    Google Scholar 

  5. R. Cavallo and M. Pittarelli. The theory of probabilistic databases. In P. M. Stocker and W. Kent, editors, Proc. 13th Int. Conf. on Very Large Data Bases, pages 71–81, 1987.

    Google Scholar 

  6. M. H. Van Emden and R. A. Kowalski. The semantics of predicate logic as a programming language. Journal of the ACM, 23(4):733–742, 1976.

    Article  Google Scholar 

  7. E. Engeler and P. Läuchli. Berechnungstheorie für Informatiker. Teubner Stuttgart, 1988.

    Google Scholar 

  8. M. H. Van Emden. Quantitative deduction and its fixpoint theory. Logic Programming, 3(1):37–53, 1986.

    Article  Google Scholar 

  9. N. Fuhr. A probabilistic framework for vague queries and imprecise information in databases. In D. McLeod, R. Sacks-Davis, and H. Schek, editors, Proc. 16th Int. Conf. on Very Large Data Bases, pages 696–707, 1990.

    Google Scholar 

  10. D. Heckermann. Probabilistic interpretation for mycin's certainty factors. In L. N. Kanal and J. F. Lemmer, editors, Uncertainty in Artificial Intelligence, pages 167–196. North-Holland, 1986.

    Google Scholar 

  11. T. Hrycej. Gibbs sampling in bayesian networks. Artifical Intelligence, 46(3):351–363, 1990.

    Article  Google Scholar 

  12. M. Kifer and A. Li. On the semantics of rule-based expert systems with uncertainty. In M. Gyssens, J. Paredanens, and D. Van Gucht, editors, Proc. Int. Conf. on Database Theory (ICDT 88), pages 102–117, 1988.

    Google Scholar 

  13. M. Kifer and V. S. Subrahmanian. On the expressive power of annotated logic programs. In E. L. Lusk and R. A. Overbeek, editors, Proc. North American Conference on Logic Programming, pages 1069–1089, 1989.

    Google Scholar 

  14. J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, second edition, 1987.

    Google Scholar 

  15. K. S. Leung, M. H. Wong, and W. Lam. A fuzzy expert database system. Data & Knowledge Engineering, 4:287–304, 1989.

    Google Scholar 

  16. N. J. Nilsson. Probabilistic logic. Artifical Intelligence, 28:71–87, 1986.

    Google Scholar 

  17. R. T. Ng and V. S. Subrahmanian. Relating dempster-shafer theory to stable semantics. In V. Saraswat and K. Ueda, editors, Proc. Int. Symposium on Logic Programming, pages 551–565, 1991.

    Google Scholar 

  18. R. T. Ng and V. S. Subrahmanian. A semantical framework for supporting subjective and conditional probabilities in deductive databases. In K. Furukawa, editor, Proc. Int. Conf. on Logic Programming, pages 565–580, 1991.

    Google Scholar 

  19. E. Y. Shapiro. Logic programs with uncertainties: A tool for implementing rule-based systems. In A. Bundy, editor, Proc. 8th Int. Joint Conf. on Artificial Intelligence, pages 329–352, 1983.

    Google Scholar 

  20. P. Schäuble and B. Wüthrich. On the expressive power of query languages. Technical Report 173, ETH Zurich, Department of Computer Science, 1992.

    Google Scholar 

  21. B, Wüthrich. Large Deductive Databases with Constraints. PhD thesis, Swiss Federal Institute of Technology (ETH), 1991.

    Google Scholar 

  22. B. Wüthrich. Towards probabilistic knowledge bases. Technical Report 92-9, European Computer-Industry Research Center (ECRC), 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wüthrich, B. (1992). Towards probabilistic knowledge bases. In: Voronkov, A. (eds) Logic Programming and Automated Reasoning. LPAR 1992. Lecture Notes in Computer Science, vol 624. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013049

Download citation

  • DOI: https://doi.org/10.1007/BFb0013049

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55727-2

  • Online ISBN: 978-3-540-47279-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics