CSDL Home IEEE Transactions on Knowledge & Data Engineering 1997 vol.9 Issue No.01 - January-February
Issue No.01 - January-February (1997 vol.9)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.567045
<p><b>Abstract</b>—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. In this paper, 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.</p>
Deductive databases, empirical probabilities, model semantics, constraint satisfaction, optimizations, query answering.
Raymond T. Ng, "Semantics, Consistency, and Query Processing of Empirical Deductive Databases", IEEE Transactions on Knowledge & Data Engineering, vol.9, no. 1, pp. 32-49, January-February 1997, doi:10.1109/69.567045