Skip to main content
SpringerLink
Log in
Book cover

International Conference on Automated Deduction

CADE 1997: Automated Deduction—CADE-14 pp 416–430Cite as

Evolving combinators

  • Conference paper
  • First Online:

  • 240 Accesses

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

Abstract

One of the many abilities that distinguish a mathematician from an automated deduction system is to be able to offer appropriate expressions based on intuition and experience that are substituted for existentially quantified variables so as to simplify the problem at hand substantially. We propose to simulate this ability with a technique called genetic programming for use in automated deduction. We apply this approach to problems of combinatory logic. Our experimental results show that the approach is viable and actually produces very promising results. A comparison with the renowned theorem prover Otter underlines the achievements.

This work was supported by the Deutsche Forschungsgemeinschaft (DFG).

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

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. Barendregt, H.P.:The Lambda Calculus: Its Syntax and Semantics, North-Holland, Amsterdam, 1981.

    MATH  Google Scholar 

  2. Biundo, S.:Automated Synthesis of Recursive Algorithms as a Theorem Proving Tool, Proc. 8th European Conference on AI (ECAI-88), Munich, GER, 1988, Pitman Publishing, pp. 553–558.

    Google Scholar 

  3. Curry, H.B.; Feys, R.:Combinatory Logic, North-Holland, Amsterdam, 1958.

    MATH  Google Scholar 

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

    Google Scholar 

  5. De Jong, K.:Learning with Genetic Algorithms: An Overview, Machine Learning 3:121–138, 1988.

    Google Scholar 

  6. Dracopoulos, D.C.; Kent, S.:Speeding up Genetic Programming: A Parallel BSP Implementation, Proc. 1st International Conference on Genetic Programming (GP-96), Stanford University, CA, USA, 1996, MIT Press, p. 421.

    Google Scholar 

  7. Ertel, W.:Random Competition: A Simple, but Efficient Method for Parallelizing Inference Systems, Techn. Report TUM-19050, Technical University of Munich, 1990.

    Google Scholar 

  8. Holland, J.H.:Adaptation in natural and artificial systems, Ann Arbor: Univ. of Michigan Press, 2nd edition, 1992.

    Book  Google Scholar 

  9. Koza, J.R.:Genetic Programming: On the Programming of Computers by Means of Natural Selection, MIT Press, Cambridge, MA, 1992.

    MATH  Google Scholar 

  10. Koza, J.R.:Genetic Programming II: Automatic Discovery of Reusable Programs, MIT Press, Cambridge, MA, 1994.

    MATH  Google Scholar 

  11. Lusk, E.; McCune, W.:Uniform Strategies: The CADE-11 Theorem Proving Contest, Journal of Automated Reasoning 11:317–331, 1993.

    Article  MathSciNet  Google Scholar 

  12. Lusk, E.; Wos, L.:Benchmark Problems in Which Equality Plays the Major Role, CADE-11, Saratoga Springs, NY, USA, 1992, Springer LNAI 607, pp. 781–785.

    Google Scholar 

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

    Google Scholar 

  14. McCune, W.; Wos, L.:A Case Study in Automated Theorem Proving: Finding Sages in Combinatory Logic, Journal of Automated Reasoning 3:91–107, 1987.

    Article  MathSciNet  Google Scholar 

  15. Niwa, T.; Iba, H.:Distributed Genetic Programming: Empirical Study and Analysis, Proc. 1st International Conference on Genetic Programming (GP-96), Stanford University, CA, USA, 1996, MIT Press, pp. 339–344.

    Google Scholar 

  16. O'Donnell, M.J.:Computing in Systems Described by Equations, Springer LNCS 58, 1977.

    Google Scholar 

  17. Smullyan, R.:To Mock a Mockingbird, A. Knopf, New York, 1985.

    Google Scholar 

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

    Google Scholar 

  19. Wos, L.; McCune, W.:Challenge Problems Focusing on Equality and Combinatory Logic: Evaluating Automated Theorem-Proving Programs, CADE-9, Argonne, IL, USA, 1988, Springer LNCS 310, pp. 714–729.

    MATH  Google Scholar 

  20. Wos, L.; Winker, S.; McCune, W.; Overbeek, R., Lusk, E.; Stevens, R.:Automated Reasoning Contributes to Mathematics and Logic, CADE-10, Kaiserslautern, GER, 1990, Springer LNAI 449, pp. 485–499.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik, Universität Kaiserslautern, Postfach 3049, 67653, Kaiserslautern, Germany

    Matthias Fuchs

Authors
  1. Matthias Fuchs
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

William McCune

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fuchs, M. (1997). Evolving combinators. 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_42

Download citation

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

  • 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

Search

Navigation