Skip to main content
SpringerLink
Log in

Formal reasoning in intelligent database systems

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

Expert database systems were proposed to solve the difficulties encountered in traditional database systems. Prolog provides a fast prototyping tool for building such database systems. However, an intelligent database system implemented in Prolog faces a major restriction that only Horn rules are allowed in the knowledge base. We propose a theorem prover which can make inference for non-Horn intelligent database systems. Conclusions can be deduced from the facts and rules stored in a knowledge base. For a knowledge base with a finite domain, the prover can provide correct answers to queries, derive logical consequences of the database, and provide help in detecting inconsistencies or locating bugs in the database. The theorem prover is efficient in deriving conclusions from large knowledge bases which might swamp most of the other deductive systems. The theorem prover is also useful in solving heuristically the satisfiability problem related to a database with an infinite domain. A truth maintenance mechanism is provided to help eliminate repetitious work for the same goals.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. H. Gallaire and J. Minker,Logic and Data Bases, Plenum Press, New York, 1978.

    Google Scholar 

  2. L. Kerschberg,Expert Database Systems, The Benjamin/Cummings Publishing Company, Menlo Park, CA, 1987.

    Google Scholar 

  3. D.J. Israel, “The role of logic in knowledge representation,”Computer, pp. 37–41, October, 1983.

  4. J.W. Lloyd,Foundations of Logic Programming, 2nd ed. Springer-Verlag, 1987.

  5. J.W. Lloyd, “Logic as a foundation for deductive database systems,” inProceedings of IFIP Conference on Information Processing, San Francisco, August 1989, pp. 323–324.

  6. V. Lifschitz, “Logical foundations of deductive databases,” inProceedings of IFIP Conference on Information Processing, San Francisco, August 1989.

  7. D. Loveland,automated Theorem Proving: A Logical Basis, North-Holland, New York, 1978.

    Google Scholar 

  8. D. Plaisted, “An efficient relevance criterion for mechanical theorem proving,” inProceedings of the First Annual National Conference on Artificial Intelligence, pp. 79–83, 1980.

  9. S. Jefferson and D. Plaisted, “Implementation of an improved relevance criterion,” inProceedings of the First Conference on Artificial Intelligence Applications, pp. 476–482, 1984.

  10. C. Chang and R. Lee,Symbolic Logic and Mechanical Theorem Proving, Academic Press, New York, 1973.

    Google Scholar 

  11. D. Plaisted and S. Greenbaum, “A structure-preserving clause form translation,”Journal of Symbolic Computation, 2:293–304, 1986.

    Google Scholar 

  12. M. Davis and H. Putnam, “A computing procedure for quantification theory,”Journal of the Association for Computing Machinery, 7:201–215, 1960.

    Google Scholar 

  13. S.-J. Lee and D. Plaisted, “Eliminating duplication with the hyper-linking strategy,”Journal of Automated Reasoning, 9(1):25–42, 1992.

    Google Scholar 

  14. L. Wos, G. Robinson, and D. Carson, “Efficiency and completeness of the set of support strategy in theorem proving,”Journal of the Association for Computing Machinery, 12:536–541, 1965.

    Google Scholar 

  15. W.W. McCune,Otter 1.0 User's Guide, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, Illinois, January 1989.

    Google Scholar 

  16. J.D. Ullman,Database and Knowledge-Base Systems, Computer Science Press, 1988.

  17. S.-J. Lee and D. Plaisted, “Problem solving by searching for models with a theorem prover,”Artificial Intelligence, to appear.

  18. L. Wos, R. Overbeek, E. Lusk, and J. Boyle,Automated Reasoning: Introduction and Applications, Prentice Hall, Englewood Cliffs, N.J., 1984.

    Google Scholar 

  19. F. Hayes-Roth, “Rule-based systems,”Communications of the Association for Computing Machinery, 28(9):921–932, 1985.

    Google Scholar 

  20. M.E. Stickel, “A prolog technology theorem prover: Implementation by an extended prolog compiler,”Journal of Automated Reasoning, 4:353–380, 1988.

    Google Scholar 

  21. F.J. Pelletier, “Seventy-five problems for testing automatic theorem provers,”Journal of Automated Reasoning, 2:191–216, 1986.

    Google Scholar 

  22. R.E. Korf, “Search,” in S.C. Shapiro, editor,Encyclopedia of Artificial Intelligence, Wiley-Interscience, New York, 1987.

    Google Scholar 

  23. X. Nie,Implementation Techniques in Automatic Theorem Proving, PhD. thesis, University of North Carolina at Chapel Hill, 1989.

  24. N.J. Nilsson,Problem-Solving Methods in Artificial Intelligence, McGraw-Hill, New York, 1971.

    Google Scholar 

  25. S.-J. Lee and C.-H. Wu, “Controlling storage consumption in mechanical theorem proving,” inProceedings of the 2nd International Conference on Automation Technology, Taipei, Taiwan, July 1992, pp. 201–207.

  26. R. Reiter, “On closed world data bases,” in H. Gallaire and J. Minker, editors,Logic and Data Bases, Plenum Press, New York, 1978.

    Google Scholar 

  27. R. Reiter, “A logic for default reasoning,”Artificial Intelligence, 13:81–132, 1980.

    Google Scholar 

  28. D.W. Patterson,Introduction to Artificial Intelligence and Expert Systems, Prentice-Hall, Inc., 1990.

  29. T.M. Mitchell, R.M. Keller, and S.T. Kedar-Cabelli, “Explanation-based generalization: A unifying view,”Machine Learning, 1(1), 1986.

  30. G. DeJong and R. Mooney, “Explanation-based learning: An alternative view,”Machine Learning, 1(2), 1986.

  31. D. Plaisted, “Non-Horn clause logic programming without contrapositives,”Journal of Automated Reasoning, 4:287–325, 1988.

    Google Scholar 

  32. J. Doyle, “A truth maintenance system,”Artificial Intelligence, 12(3), 1979.

  33. D. McAllester, “An outlook on truth maintenance,” Technical Report AIM-551, Artificial Intelligence Laboratory, MIT, Cambridge, MA, 1980.

    Google Scholar 

  34. E. Rich and K. Knight,Artificial Intelligence, McGraw-Hill, New York, 1991.

    Google Scholar 

  35. R. Boyer and J.S. Moore,A Computational Logic, Academic Press, New York, 1979.

    Google Scholar 

  36. W. Bibel,Automated Theorem Proving, Vieweg, 1982.

  37. D.A. Plaisted, G. Alexander, H. Chu, and S.-J. Lee, “Conditional term rewriting and first-order theorem proving,” inInternational Workshop on Conditional Term-Rewriting Systems, Lecture Notes in Computer Science, Pont-à-Mousson, France, July 1992.

    Google Scholar 

  38. R.E. Korf, “Real-time heuristic search: first results,” inProceedings of AAAI-87, Seattle, WA, 1987, pp. 133–138.

  39. B. Lipman, “How to decide how to decide how to... limited rationality in decisions and games,” inProceedings of AAAI Symposium on AI and Limited Rationality, Stanford, CA, 1989.

  40. L.G. Valiant, “A theory of the learnable,”Communications of the ACM, 18:1134–1142, 1984.

    Google Scholar 

  41. D. Haussler, “Quantifying inductive bias: AI learning algorithms and Valiant's learning framework,”Artificial Intelligence, 36:177–221, 1988.

    Google Scholar 

  42. E.J. Horvitz, “Reasoning under varying and uncertain resource constraints,” inProceedings of AAAI-88, St. Paul, MN, 1988, pp. 139–144.

  43. O. Hansson and A. Mayer, “Probabilistic heuristic estimates,”Annuals of Mathematics and Artificial Intelligence, 2:209–220, 1990.

    Google Scholar 

  44. S.J. Russel and E.H. Wefald, “Principles of metareasoning,”Artificial Intelligence, 49:361–395, 1989.

    Google Scholar 

  45. J.A. Barnett, “How much is control knowledge worth? A primitive example,”Artificial Intelligence, 22:77–89, 1984.

    Google Scholar 

  46. R. Davis, “Meta-rules: reasoning about control,”Artificial Intelligence, 15:179–222, 1980.

    Google Scholar 

  47. M. Bratman, D. Israel, and M. Pollack, “Plans and resource-bounded practical reasoning,”Computational Intelligence, 4:349–355, 1988.

    Google Scholar 

  48. D. Pastre, “MUSCADET: an automatic theorem proving system using knowledge and metaknowledge in mathematics,”Artificial Intelligence, 38:257–318, 1989.

    Google Scholar 

  49. S.-J. Lee and D. Plaisted, “Use of replace rules in theorem proving,”Methods of Logic in Computer Science, to appear.

  50. S.A. Cook, “The complexity of theorem-proving procedures,” inProceedings of the 3rd Annual ACM Symposium on Theory of Computing, pp. 151–158, 1971.

  51. M. Buro and U.K. Büning, “Report on a SAT competition,” Technical report, Mathematik/Informatik, Universität Paderborn, 1992.

  52. D. Plaisted, “Complete problems in the first-order predicate calculus,”Journal of Computer and System Sciences, 29:8–35, 1984.

    Google Scholar 

  53. H. Lewis, “Complexity results for classes of quantificational formulas,”Journal of Computer and System Sciences, 21:317–353, 1980.

    Google Scholar 

  54. F. Pereira,C-Prolog User's Manual, SRI International, Menlo Park, California, August 1984.

    Google Scholar 

  55. L. Sterling and E. Shapiro,The Art of Prolog, The MIT Press, Cambridge, Massachusetts, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, National Sun Yat-Sen University, Kaohsiung, Taiwan 80424, ROC

    Shie-Jue Lee

Authors
  1. Shie-Jue Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Supported by National Science Council under grant NSC 81-0408-E-110-9.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lee, SJ. Formal reasoning in intelligent database systems. Appl Intell 5, 297–317 (1995). https://doi.org/10.1007/BF00880011

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00880011

Keywords

Search

Navigation