Issue No. 05 - October (1994 vol. 6)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.317702
<p>We introduce an inference scheme, based on the compilation approach, that can answer "true," provable-false," "indefinite," or "assumable-false" to a closed query in an indefinite deductive database under the generalized closed world assumption. The inference scheme proposed in this paper consists of a representation scheme and an evaluation process that uses one of two groups of positive indefinite ground clauses (PIGC's) derivable from the database for a given query. These two groups of PIGC's are base-PIGC's and descendants of base-PIGC's. We prove that the set of base-PIGC's derivable from the database is sufficient to infer the indefiniteness of a query. This newly proposed method offers many advantages over the existing compilation method. This new method outperforms the existing one in terms of the cost of compilation, ease in the handling of updates, and efficiency in query evaluation.</p>
deductive databases; query processing; uncertainty handling; inference mechanisms; database theory; knowledge representation; indefiniteness inference scheme; indefinite deductive databases; compilation approach; closed query; indefinite deductive database; generalized closed world assumption; knowledge representation; positive indefinite ground clauses; cost; update handling; query evaluation
C. Ku, H. Kim and L. Henschen, "An Efficient Indefiniteness Inference Scheme in Indefinite Deductive Databases," in IEEE Transactions on Knowledge & Data Engineering, vol. 6, no. , pp. 713-722, 1994.