Skip to main content
Springer Nature Link
Log in

Replacement Rules with Definition Detection

  • Conference paper
  • First Online:
Automated Deduction in Classical and Non-Classical Logics (FTP 1998)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1761))

Included in the following conference series:

Abstract

The way in which a theorem prover handles Definitions can have a significant effect on its performance. Many first-order clause form theorem provers perform badly on theorems such as those from set theory that are proven largely by expanding Definitions. The technique of using replacement rules permits automatic proofs of such theorems to be found quickly in many cases. We present a refinement of the replacement rule method which increases its effectiveness. This refinement consists in recognizing which clauses are obtained from first-order Definitions.

This research was partially supported by the National Science Foundation under grant CCR-9108904

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Matthew Bishop and Peter B. Andrews. Selectively instantiating Definitions. In Proceedings of the 15th International Conference on Automated Deduction, pages 365–380, 1998.

    Google Scholar 

  2. W. W. Bledsoe and G. Feng. Set-var. Journal of Automated Reasoning, 11(3):293–314, 1991.

    Article  MathSciNet  Google Scholar 

  3. W. W. Bledsoe. Non-resolution theorem proving. Artificial Intelligence, 9:1–35, 1977.

    Article  MATH  MathSciNet  Google Scholar 

  4. D. Cantone, E.G. Omodeo, and A. Policriti. The automation of syllogistic II: optimization and complexity issues. Journal of Automated Reasoning, 6(2):173–187, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  5. Heng Chu and D. Plaisted. Semantically guided first-order theorem proving using hyper-linking. In Proceedings of the Twelfth International Conference on Automated Deduction, pages 192–206, 1994. Lecture Notes in Artificial Intelligence 814.

    Google Scholar 

  6. G. Dowek, T. Hardin, and C. Kirchner. Theorem proving modulo. Technical Report 3400, Institut National de Recherche en Informatique et en Automatique (INRIA), Le Chesnay, France, April 1998.

    Google Scholar 

  7. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem-proving. Communications of the ACM, 5:394–397, 1962.

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  9. D. Gabbay, J. Ohlbach, and D. Plaisted. Killer transformations. In Proc. 1993 Workshop on Proof Theory in Modal Logic, pages 1–45, Hamburg, Germany, 1993.

    Google Scholar 

  10. S.-J. Lee and D. Plaisted. Use of replace rules in theorem proving. Methods of Logic in Computer Science, 1:217–240, 1994.

    Google Scholar 

  11. W. McCune. Otter 2.0 (theorem prover). In M.E. Stickel, editor, Proceedings of the 10th International Conference on Automated Deduction, pages 663–4, July 1990.

    Google Scholar 

  12. M. Paramasivam. Instance-Based First-Order Methods Using Propositional Calculus Provers. PhD thesis, University of North Carolina at Chapel Hill, 1997.

    Google Scholar 

  13. L.C. Paulson. Set theory for verification I: from foundations to functions. Journal of Automated Reasoning, 11(3):352–390, 1992.

    MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  15. D. Plaisted and R Potter. Term rewriting: Some experimental results. Journal of Symbolic Computation, 11:149–180, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  16. M. Paramasivam and D. Plaisted. A replacement rule theorem prover. Journal of Automated Reasoning, 18(2):221–226, 1997.

    Article  Google Scholar 

  17. M. Paramasivam and D. Plaisted. Automated deduction techniques for classification in description logics. Journal of Automated Reasoning, 20(3):337–364, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  18. D. Plaisted and Y. Zhu. Ordered semantic hyper linking. In Proceedings of Fourteenth National Conference on Artificial Intelligence (AAAI97), Providence, Rhode Island, 1997.

    Google Scholar 

  19. A. Quaife. Automated deduction in NBG set theory. Journal of Automated Reasoning, 8(1):91–147, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  20. C.B. Suttner and G. Sutcliffe. The TPTP problem library (TPTP v2.0.0). Technical Report AR-97-01, Institut für Informatik, Technische Universität München, Germany, 1997.

    Google Scholar 

  21. 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.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    David A. Plaisted & Yunshan Zhu

Authors
  1. David A. Plaisted
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yunshan Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Leibniz-IMAG, 46 Avenue Felix Viallet, 38031, Grenoble cedex, France

    Ricardo Caferra

  2. Technical University of Vienna, Favoritenstraße 9-11/E185-2, 1040, Vienna, Austria

    Gernot Salzer

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Plaisted, D.A., Zhu, Y. (2000). Replacement Rules with Definition Detection. In: Caferra, R., Salzer, G. (eds) Automated Deduction in Classical and Non-Classical Logics. FTP 1998. Lecture Notes in Computer Science(), vol 1761. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46508-1_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-46508-1_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67190-9

  • Online ISBN: 978-3-540-46508-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics