Skip to main content

CODE: A powerful prover for problems of condensed detachment

  • Conference paper
  • First Online:

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

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Christian, J.:Flatterms, discrimination nets, and fast term rewriting, JAR 10, 1993, pp. 95–113.

    Article  MathSciNet  Google Scholar 

  2. Denzinger, J.; Fuchs, M.:Goal oriented equational theorem proving using teamwork, Proc. 18th KI-94, Saarbrücken, GER, Springer LNAI 861, 1994, pp. 343–354.

    Google Scholar 

  3. Fuchs, M.:Powerful Search Heuristics Based on Weighted Symbols, Level and Features, Proc. FLAIRS '96, Key West, FL, USA, 1996, pp. 449–453.

    Google Scholar 

  4. Fuchs, M.:Experiments in the Heuristic Use of Past Proof Experience, Proc. CADE-13, New Brunswick, NJ, USA, 1996, Springer LNAI 1104, pp. 523–537.

    Google Scholar 

  5. Graf P.:Term Indexing, Springer Verlag, Springer LNAI 1053, 1995.

    Google Scholar 

  6. Hillenbrand, T.; Buch, A.; Fettig, R.:On Gaining Efficiency in Completion-Based Theorem Proving, Proc. 7th RTA, 1996, Springer LNCS 1103, pp. 432–435.

    Google Scholar 

  7. Lukasiewicz, J.:Selected Works, L. Borkowski (ed.), North-Holland, 1970.

    Google Scholar 

  8. McCune, W.; Wos, L.:Experiments in Automated Deduction with Condensed Detachment, Proc. CADE-11, Saratoga Springs, NY, USA, 1992, Springer LNAI 607, pp. 209–223.

    MATH  Google Scholar 

  9. McCune, W.:OTTER 3.0 Reference Manual and Guide, Techn. Report ANL-94/6, Argonne Natl. Laboratory, 1994.

    Google Scholar 

  10. Peterson, G.J.:An automatic theorem prover for substitution and detachment systems, Notre Dame Journal of Formal Logic, Vol. 19, Number 1, January 1976, pp. 119–122.

    Article  MathSciNet  Google Scholar 

  11. Slaney, J.:SCOTT: A Model-Guided Theorem Prover, Proc. IJCAI '93, Chambery, FRA, 1993, AAAI Press, pp. 109–114.

    Google Scholar 

  12. Sutcliffe, G.; Suttner, C.; Yemenis, T.:The TPTP Problem Library, Proc. CADE-12, Nancy, FRA, 1994, Springer LNAI 814, pp. 252–266.

    Google Scholar 

  13. Tarski, A.:Logic, Semantics, Metamathematics, Oxford University Press, 1956.

    Google Scholar 

  14. Wos, L.:Meeting the Challenge of Fifty Years of Logic, JAR 6, 1990, pp. 213–232.

    Article  MathSciNet  Google Scholar 

  15. Wos, L.:Searching for Circles of Pure Proofs, JAR 15, 1995, pp. 279–315.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

William McCune

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fuchs, D., Fuchs, M. (1997). CODE: A powerful prover for problems of condensed detachment. In: McCune, W. (eds) Automated Deduction—CADE-14. CADE 1997. Lecture Notes in Computer Science, vol 1249. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63104-6_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-63104-6_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63104-0

  • Online ISBN: 978-3-540-69140-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics