This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Efficient Indefiniteness Inference Scheme in Indefinite Deductive Databases
October 1994 (vol. 6 no. 5)
pp. 713-722

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.

[1] G. Bossu and P. Siegel, "Saturation, nonmonotonic reasoning and the closed-world assumption,"Artificial Intell., vol. 25, pp. 13-52, 1985.
[2] C. L. Chang and R. C. T. Lee,Symbolic Logic and Mechanical Theorem Proving. New York: Academic, 1973.
[3] E. F. Codd, "A relational model of data for large shared data banks,"Commun. ACM, pp. 377-387, June 1970.
[4] H. Gallaire and J. Minker,Logic and Data Bases. New York: Plenum, 1978.
[5] H. Gallaire, J. Minker, and J. Nicolas, "Logic and databases: A deductive approach,"ACM Comput. Surveys, vol. 16, pp. 153-185,1984.
[6] M.R. Genesereth and N.J. Nilsson,Logical Foundations of Artificial Intelligence, Morgan Kaufmann, San Mateo, Calif., 1987.
[7] J. Grant and J. Minker, "Answering queries in indefinite databases and the null value nroblems."Tech. Rep. 1374, Comput. Sci. Dept., Univ. of Maryland, College Park, MD, USA, 1983.
[8] L. J. Henschen and H. S. Park, "Compiling the GCWA in indefinite deductive databases," in J. Minker, Ed.,Foundations of Deductive Databases and Logic Programming. Los Altos, CA: Morgan Kaufmann, 1987.
[9] H. D. Kim, "A storage scheme for efficient processing of queries in indefinite deductive databases," Ph.D. dissertation, Northwestern Univ., Evanston, IL, USA, June 1988.
[10] C. S. Ku, "Incremental compilation of rules in indefinite deductive databases," Ph.D. dissertation, Northwestern Univ., Evanston, IL, USA, June 1989.
[11] Z. Manna and R. Waldinger,The Logical Basis for Computer Programming, vol. 1,Deductive Reasoning. Reading, MA: Addison-Wesley, 1985.
[12] J. Minker, "On indefinite databases and the closed world assumption," inLecture Notes in Computer Science, no. 138, pp. 292-308, Springer-Verlag, 1982.
[13] R. Reiter, "Deductive question-answering on relational databases," in H. Gallaire and J. Minker, Eds.,Logic and Data Bases. New York: Plenum, 1978, pp. 149-177.
[14] R. Reiter, "On closed world data bases," in H. Gallaire and J. Minker,Logic and Data Bases. New York: Plenum, 1978, pp. 55-76.
[15] R. Reiter, "Towards a logical reconstruction of relational database theory," in M. L. Brodie, J. Mylopoulos, and J. W. Schmidt, Eds.,On Conceptual Modeling. New York: Springer-Verlag, 1984, pp. 191-238.
[16] J. A. Robinson, "A machined-oriented logic based on the resolution principle,"J. Assoc. Comput. Mach., vol. 12, no. 1, pp. 23-41, Jan. 1965.
[17] J. D. Ullman,Principles of Databases Systems. Rockville, MD: Computer Science Press, 1982.
[18] M. H. van Emden and R. A. Kowalski, "The semantics of predicate logic as a programming language,"J. ACM, vol. 23, no. 4, pp. 733- 743, 1976.
[19] L. Wos, R. Overbeek, E. Lusk, and J. Boyle,Automated Reasoning: Introduction and Applications. Englewood Cliffs, NJ: Prentice-Hall, 1974.
[20] A. Yahya and L. J. Henschen, "Deduction in non-Horn database,"J. Automated Reasoning, vol. 1, no. 2, pp. 141-160, 1985.
[21] H. W. Yum, "An incremental compiler for an indefinite deductive database," M.S. project, Northwestern Univ., Evanston, IL, USA, May 1989.

Index Terms:
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
Citation:
C.S. Ku, H.D. Kim, L.J. Henschen, "An Efficient Indefiniteness Inference Scheme in Indefinite Deductive Databases," IEEE Transactions on Knowledge and Data Engineering, vol. 6, no. 5, pp. 713-722, Oct. 1994, doi:10.1109/69.317702
Usage of this product signifies your acceptance of the Terms of Use.