Abstract
The class of non-Horn, function-free databases is investigated and several aspects of the problem of using theorem proving techniques for such databases are considered. This includes exploring the treatment of negative information and extending the existing method, suggested by Minker, to accept non-unit negative clauses. It is shown that the algorithms based on the existing methods for the treatment of negative information can be highly inefficient. An alternative approach is suggested and a simpler algorithm based on it is given. The problems associated with query answering in non-Horn databases are addressed and compared with those for the Horn case. It is shown that the query evaluation process can be computationaly difficult in the general case. Conditions under which the process is simplified are discussed. The topic of non-Horn general laws is considered and some guidelines are suggested to divide such laws into derivation rules and integrity constraints. The effect of such a division on the query evaluation process is discussed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Chang, C. L., ‘ On evaluation of queries containing derived relations’, in Formal Bases for Databases, Preprints, Toulouse, France (1979).
Chang C. L. and Lee R. C. T., Symbolic Logic and Mechanical Theorem Proving, Computer Science and Applied Mathematics, Series, Academic Press, New York, (1973).
Clark K. L., ‘Negation as failure’, in Logic and Databases (eds. H.Gallaire and J.Minker), Plenum Press, New York, 293–324, (1978).
Codd E. F., ‘Extending the database relational model to capture more meaning’, ACM Transactions on Database Systems 4, 4, 339–434 (December, 1979).
Date C. J., An Introduction to Database Systems, 3rd. Ed., Addison-Wesley Publishing Co., Reading, Mass. (1982).
Gallaire H., Minker J., and Nicolas J. M., ‘An overview and introduction to logic and databases’, in Logic and Databases (eds. H.Gallaire and J.Minker), Plenum Press, New York, 3–32 (1978).
Ghafarzade, M., ‘Function symbols in first-order databases’, Ph.D. Dissertation, EECS Department Northwestern University, Evanston, I11. (1981).
Henschen L. and Naqvi S., ‘On compiling queries in recursive first-order databases’, Accepted JACM 31, 1, 47–85 (January, 1984).
Henschen L. and Wos L., ‘Unit refutation and Horn sets’, JACM 21, 4, 590–605 (October, 1974).
Kowalski R., ‘Logic for data description’, in Logic and Databases (eds. H.Gallaire and J.Minker) Plenum Press, New York, 77–106 (1978).
Lipski W.Jr., ‘On semantic issues connected with incomplete information databases’, ACM Transactions on Database Systems 4, 3, 262–301 (September 1979).
Minker J., ‘On indefinite databases and the closed world assumption’, Technical Report, University of Maryland, College Park, Maryland, (July, 1981).
Minker J., ‘On theories of definite and indefinite databases’, University of Maryland, College Park, Maryland, 1983. Submitted for publication to the JACM.
Minker J. and Grant J., ‘Answering queries in indefinite databases and the null value problem’, University of Maryland, College Park, Maryland (1984).
Nicolas J. M. and Yazadanian K., ‘Logic and database integrity’, in Logic and Databases (eds. H.Gallaire and J.Minker), Plenum Press, New York, 325–346, (1978).
Reiter R., ‘Deductive question-answering in relational databases’, in Logic and Databases (eds. H.Gallaire and J.Minker.), Plenum Press, New York, 149–178 (1978).
Reiter R., ‘Equality and domain closure in first-order databases’, JACM 27, 4, 235–250 (April 1980).
Reiter R., ‘On closed world databases’, in Logic and Databases (eds. H.Gallaire and J.Minker) Plenum Press, New York 55–76 (1978).
VanEmden M. H. and Kowalski R. A., ‘The semantics of predicate logic as a programming language’, JACM 23, 733–742 (October, 1976).
Vassiliou, Y., ‘Null values in database management: a denotational semantics approach’, ACM/SIGMOD International Symposium on Management of Data, 162–169 (May–June, 1977).
Yahya, A., ‘Deduction in non-Horn databases’, Ph.D. Dissertation, EECS Department North-western University, Evanston, I11. (1984).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Yahya, A., Henschen, L.J. Deduction in non-Horn databases. J Autom Reasoning 1, 141–160 (1985). https://doi.org/10.1007/BF00244994
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00244994