Deductive Databases with Incomplete Information (Extended Abstract) (1992)
| Venue: | In Proceedings of the Joint International Conference and Symposium on Logic Programming |
| Citations: | 9 - 2 self |
BibTeX
@INPROCEEDINGS{Dong92deductivedatabases,
author = {F. Dong and Fangqing Dong and Laks V. S. Lakshmanan},
title = {Deductive Databases with Incomplete Information (Extended Abstract)},
booktitle = {In Proceedings of the Joint International Conference and Symposium on Logic Programming},
year = {1992},
pages = {303--317},
publisher = {MIT Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
) Fangqing Dong and Laks V.S. Lakshmanan Dept. of Computer Science, Concordia University Montreal Quebec, Canada H3G 1M8 Abstract We consider query processing in deductive databases with incomplete information in the form of null values. We motivate the problem of extracting the maximal information from a (deductive) database in response to queries, and formalize this in the form of conditional answers. We give a sound and complete top-down proof procedure for generating conditional answers. We also extend the well-known magic sets method to handle null values, and show that the transformed program executed by semi-naive evaluation (with minor extensions) is correct in the sense that it will generate all and only valid conditional answers w.r.t. the original program. 1 Introduction Most of the works on deductive databases have only considered a complete information model for the set of facts available for the EDB (or base) relations. For many applications available information is typ...
