Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Conditional Term Rewriting Systems

CTRS 1992: Conditional Term Rewriting Systems pp 257–271Cite as

Conditional term rewriting and first-order theorem proving

  • Theorem-Proving and Normal Form Languages
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((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.

This research was partially supported by the National Science Foundation under grant CCR-9108904; Fachbereich Informatik, Universitaet Kaiserslautern, Kaiserslautern, Germany; and the Max-Planck-Institut fuer Informatik, Saarbruecken, Germany

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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. 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. 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. 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. L. Bachmair, H. Ganzinger, C. Lynch, and W. Snyder. Basic paramodulation and basic strict superposition. submitted, 1991.

    Google Scholar 

  7. 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. W. W. Bledsoe. Non-resolution theorem proving. Artificial Intelligence, 9:1–35, 1977.

    Article  Google Scholar 

  9. D. Brand. Proving theorems with the modification method. SIAM J. Comput., 4:412–430, 1975.

    Google Scholar 

  10. 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. 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. 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. F. Giunchiglia and T. Walsh. A theory of abstraction. Artificial Intelligence. to appear.

    Google Scholar 

  14. A. Haken. The intractability of resolution. Theoretical Computer Science, 39:297–308, 1985.

    Article  Google Scholar 

  15. 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. 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. C. Kirchner, H. Kirchner, and M. Rusinowitch. Deduction with symbolic constraints. Revue Francaise d'Intelligence Artificielle, 4(3):9–52, 1990.

    Google Scholar 

  18. S.-J. Lee. CLIN: An Automated Reasoning System Using Clause Linking. PhD thesis, University of North Carolina at Chapel Hill, 1990.

    Google Scholar 

  19. 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. S.-J. Lee and D. Plaisted. Eliminating duplication with the hyper-linking strategy. Journal of Automated Reasoning, 1990. to appear.

    Google Scholar 

  21. 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. 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. 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. 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. D. Plaisted. A simplified problem reduction format. Artificial Intelligence, 18:227–261, 1982.

    Article  Google Scholar 

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

    Google Scholar 

  27. D. Plaisted. The search efficiency of theorem proving strategies. Draft, 1992.

    Google Scholar 

  28. M. Protzen. Disproving conjectures. In Proceedings of the 11th International Conference on Automated Deduction, pages 340–354, July 1992.

    Google Scholar 

  29. T.C. Wang and W.W. Bledsoe. Hierarchical deduction. Journal of Automated Reasoning, 3:35–77, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of North Carolina at Chapel Hill, 27599-3175, Chapel Hill, NC

    David A. Plaisted, Geoffrey D. Alexander, Heng Chu & Shie-Jue Lee

Authors
  1. David A. Plaisted
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Geoffrey D. Alexander
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Heng Chu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Shie-Jue Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michaël Rusinowitch Jean-Luc Rémy

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Plaisted, D.A., Alexander, G.D., Chu, H., Lee, SJ. (1993). Conditional term rewriting and first-order theorem proving. In: Rusinowitch, M., Rémy, JL. (eds) Conditional Term Rewriting Systems. CTRS 1992. Lecture Notes in Computer Science, vol 656. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56393-8_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-56393-8_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56393-8

  • Online ISBN: 978-3-540-47549-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation