Advertisement

Conditional term rewriting and first-order theorem proving

  • David A. Plaisted
  • Geoffrey D. Alexander
  • Heng Chu
  • Shie-Jue Lee
Theorem-Proving and Normal Form Languages
Part of the Lecture Notes in Computer Science book series (LNCS, volume 656)

Abstract

We survey some basic issues in first-order theorem proving and their implications for conditional term-rewriting systems. In particular, we discuss the propositional efficiency of theorem proving strategies, goal-sensitivity, and the use of semantics. We give several recommendations for theorem proving strategies to enable them to properly treat these issues. Although few current theorem provers implement these recommendations, we discuss the clause linking theorem proving method and its extension to equality and semantics as examples of methods that satisfy most or all of our recommendations. Implicit induction theorem provers meet our recommendations, to some extent. We also discuss correctness and efficiency issues involved in the use of semantics in first-order theorem proving. Finally, we discuss issues of efficiency and semantics in conditional term-rewriting.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AB92]
    J. Avenhaus and K. Becker. Conditional rewriting modulo a built-in algebra. Technical Report SEKI-Report SR 92-11, Universitaet Kaiserslautern, March 1992.Google Scholar
  2. [AP92]
    G. Alexander and D. Plaisted. Proving equality theorems with hyper-linking. In Proceedings of the 11th International Conference on Automated Deduction, pages 706–710, 1992. system abstract.Google Scholar
  3. [AS92]
    Owen Astrachan and M. Stickel. Caching and lemma use in model elimination theorem provers. In D. Kapur, editor, Proceedings of the Eleventh International Conference on Automated Deduction, 1992.Google Scholar
  4. [BDP89]
    Leo Bachmair, N. Dershowitz, and D. Plaisted. Completion without failure. In Hassan Ait-Kaci and Maurice Nivat, editors, Resolution of Equations in Algebraic Structures 2: Rewriting Techniques, pages 1–30, New York, 1989. Academic Press.Google Scholar
  5. [BG90]
    Leo Bachmair and Harold Ganzinger. On restrictions of ordered paramodulation with simplification. In Mark Stickel, editor, Proceedings of the 10th International Conference on Automated Deduction, pages 427–441, New York, 1990. Springer-Verlag.Google Scholar
  6. [BGLS91]
    L. Bachmair, H. Ganzinger, C. Lynch, and W. Snyder. Basic paramodulation and basic strict superposition. submitted, 1991.Google Scholar
  7. [Ble75]
    W. W. Bledsoe. A new method for proving certain presburger formulas. In Proc. of the 3rd IJCAI, pages 15–21, Stanford, CA, 1975.Google Scholar
  8. [Ble77]
    W. W. Bledsoe. Non-resolution theorem proving. Artificial Intelligence, 9:1–35, 1977.CrossRefGoogle Scholar
  9. [Bra75]
    D. Brand. Proving theorems with the modification method. SIAM J. Comput., 4:412–430, 1975.Google Scholar
  10. [Com90]
    H. Comon. Solving inequations in term algebras. In Proceedings of 5th IEEE Symposium on Logic in Computer Science, pages 62–69, 1990.Google Scholar
  11. [DP60]
    M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the Association for Computing Machinery, 7:201–215, 1960.Google Scholar
  12. [GHL63]
    H. Gelernter, J.R. Hansen, and D.W. Loveland. Empirical explorations of the geometry theorem proving machine. In E. Feigenbaum and J. Feldman, editors, Computers and Thought, pages 153–167. McGraw-Hill, New York, 1963.Google Scholar
  13. [GW]
    F. Giunchiglia and T. Walsh. A theory of abstraction. Artificial Intelligence. to appear.Google Scholar
  14. [Hak85]
    A. Haken. The intractability of resolution. Theoretical Computer Science, 39:297–308, 1985.CrossRefGoogle Scholar
  15. [HR91]
    J. Hsiang and M Rusinowitch. Proving refutational completeness of theorem-proving strategies: the transfinite semantic tree method. J. Assoc. Comput. Mach., 38(3):559–587, July 1991.Google Scholar
  16. [KB70]
    D.E. Knuth and P.B. Bendix. Simple word problems in universal algebras. In Computational Problems in Abstract Algebra, pages 263–297. Pergamon, Oxford, U.K., 1970.Google Scholar
  17. [KKR90]
    C. Kirchner, H. Kirchner, and M. Rusinowitch. Deduction with symbolic constraints. Revue Francaise d'Intelligence Artificielle, 4(3):9–52, 1990.Google Scholar
  18. [Lee90]
    S.-J. Lee. CLIN: An Automated Reasoning System Using Clause Linking. PhD thesis, University of North Carolina at Chapel Hill, 1990.Google Scholar
  19. [LP89]
    S.-J. Lee and D. Plaisted. Theorem proving using hyper-matching strategy. In Proceedings of the 4th International Symposium on Methodologies for Intelligent Systems, pages 467–476, 1989.Google Scholar
  20. [LP90a]
    S.-J. Lee and D. Plaisted. Eliminating duplication with the hyper-linking strategy. Journal of Automated Reasoning, 1990. to appear.Google Scholar
  21. [LP90b]
    S.-J. Lee and D. Plaisted. New applications of a fast prepositional calculus decision procedure. In Proceedings of the 8th Biennial Conference of Canadian Society for Computational Studies of Intelligence, pages 204–211, 1990.Google Scholar
  22. [LP90c]
    S.-J. Lee and D. Plaisted. Reasoning with predicate replacement. In Proceedings of the 5th International Symposium on Methodologies for Intelligent Systems, 1990.Google Scholar
  23. [MW92]
    W. McCune and L. Wos. Experiments in automated deduction with condensed detachment. In Proceedings of the 11th International Conference on Automated Deduction, pages 209–223, July 1992.Google Scholar
  24. [NR92]
    R. Nieuwenhuis and A. Rubio. Theorem proving with ordering constrained clauses. In Proceedings of the 11th International Conference on Automated Deduction, pages 477–491, July 1992.Google Scholar
  25. [Pla82]
    D. Plaisted. A simplified problem reduction format. Artificial Intelligence, 18:227–261, 1982.CrossRefGoogle Scholar
  26. [Pla88]
    D. Plaisted. Non-Horn clause logic programming without contrapositives. Journal of Automated Reasoning, 4:287–325, 1988.Google Scholar
  27. [Pla92]
    D. Plaisted. The search efficiency of theorem proving strategies. Draft, 1992.Google Scholar
  28. [Pro92]
    M. Protzen. Disproving conjectures. In Proceedings of the 11th International Conference on Automated Deduction, pages 340–354, July 1992.Google Scholar
  29. [WB87]
    T.C. Wang and W.W. Bledsoe. Hierarchical deduction. Journal of Automated Reasoning, 3:35–77, 1987.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • David A. Plaisted
    • 1
  • Geoffrey D. Alexander
    • 1
  • Heng Chu
    • 1
  • Shie-Jue Lee
    • 1
  1. 1.Department of Computer ScienceUniversity of North Carolina at Chapel HillChapel Hill

Personalised recommendations