Efficient Algorithms for Approximating Answers to Queries Against Incomplete Relational Databases.
Hans‐Joachim Klein · 1999
this paper are the introduction of denotational definitions of sure answers allowing unknown values in attributes, the proposal of a new 5-- valued logic for improving the approximation of answers, and a comparison of efficient evaluation methods for the proof theoretic and the model theoretic view.