By Topic

Semantics, consistency, and query processing of empirical deductive databases

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Ng, R.T. ; Dept. of Comput. Sci., British Columbia Univ., Vancouver, BC, Canada

In recent years, there has been a growing interest in reasoning with uncertainty in logic programming and deductive databases. However, most frameworks proposed thus far, are either nonprobabilistic in nature or based on subjective probabilities. We address the problem of incorporating empirical probabilities-that is, probabilities obtained from statistical findings-in deductive databases. To this end, we develop a formal model theoretic basis for such databases. We also present a sound and complete algorithm for checking the consistency of such databases. Moreover, we develop consistency preserving ways to optimize the algorithm for practical usage. Finally, we show how query answering for empirical deductive databases can be carried out

Published in:

Knowledge and Data Engineering, IEEE Transactions on  (Volume:9 ,  Issue: 1 )