Towards implementing valuation based systems with relational databases

  • S. K. M. Wong
  • Pawan Lingras
  • Y. Y. Yao
Communications Intelligent Databases
Part of the Lecture Notes in Computer Science book series (LNCS, volume 542)


Shenoy's valuation based system provides a knowledge representation framework for a variety of applications. In this paper, we study the valuation based systems using the notions developed for relational databases. It is shown that the objects and operations in a valuation based system can in fact be conveniently expressed using relational database terminology. In this framework, the construction of a suitable Markov tree, for example, can be viewed as query optimization. This study explains some of the assumptions inherent in such a query processing, which can lead to an efficient implementation of valuation based systems.




Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Beeri, C., Fagin, R., Maier, D., Mendelzon, A., Ullman, J. and Yannakalds, M. (1981). Properties of Acyclic Database Schemes, ACM Symp. on Theory of Computing, pp.355–362.Google Scholar
  2. Fagin, R., Mendelzon, A. and Ullman, J. (1982). A Simplified Universal Relation Assumption, ACM TODS, Vol. 7, pp. 343–359.Google Scholar
  3. Kaufmann, A. and Cruon, R. (1967). Dynamic Programming, Academic Press, New York.Google Scholar
  4. Maier, D. (1983). The Theory of Relational Databases, Computer Science Press, Rockville, Maryland.Google Scholar
  5. Shenoy, P. (1989a). A Valuation-Based Language for Expert Systems, International Journal for Approximate Reasoning, Vol. 3, pp. 383–411.Google Scholar
  6. Shenoy, P. (1989b). On Spohn's Rule for Revision of Beliefs, To appear in International Journal for Approximate Reasoning.Google Scholar
  7. Shenoy, P. (1990a). A Valuation Based System for Bayesian Decision Analysis, Working Paper No. 213, School of Business, University of Kansas, Lawrence, KS.Google Scholar
  8. Shenoy, P. (1990b). Valuation Based Systems for Propositional Logic, Methodologies for Intelligent Systems, (Eds: Ras, Z., Zemankova, M., Emrich, M.), North Holland, pp. 305–312.Google Scholar
  9. Shenoy, P. (1990c). Valuation Based System for Discrete Optimization, Working Paper No. 221, School of Business, University of Kansas, Lawrence, KS.Google Scholar
  10. Shenoy, P. and Shafer, G. (1986). Propagating Belief Functions Using Local Computations, IEEE Expert, Vol. 1, pp. 43–52.Google Scholar
  11. Shenoy, P. and Shafer, G. (1988). Constraint Propagation, Working Paper No. 208, School of Business, University of Kansas, Lawrence, KS.Google Scholar
  12. Shenoy, P. and Shafer, G. (1990). Axioms for Probability and Belief-Function Propagation, Uncertainty in Artificial Intelligence, (Eds: Shachter, R., Levitt, T., Kanal, L. and Lemmer, J.), North Holland, pp. 169–198.Google Scholar
  13. Stonebraker, M. and Wong, E. (1974). Access Control in a Relational Database Management System by Query Modification, ACM National Conference, pp. 180–187.Google Scholar
  14. Wong, E. and Youssefi, K. (1976). Decomposition — A Strategy for Query Processing, ACM TODS, Vol. 1, pp. 223–241.Google Scholar
  15. Yao, S. (1979). Optimization of Query Evaluation Algorithms, ACM TODS, Vol. 4, pp. 133–155.Google Scholar

Copyright information

© Springer-Verlag 1991

Authors and Affiliations

  • S. K. M. Wong
    • 1
  • Pawan Lingras
    • 1
  • Y. Y. Yao
    • 1
  1. 1.Department of Computer ScienceUniversity of ReginaReginaCanada

Personalised recommendations