Evolving Combinators

Matthias Fuchs
Fachbereich Informatik, Universitaet Kaiserslautern
Postfach 3049, 67653 Kaiserslautern
Germany
E-mail: fuchs@informatik.uni-kl.de

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.

Keywords
Combinatory logic, genetic programmingSource
anonymous FTP server ftp.uni-kl.de [131.246.94.94]
path: /reports_uni-kl/computer_science/SEKI/1996/
file: Fuchs.SR-96-08.ps.gz