Evolving Combinators
- One of the many abilities that distinguish a mathematician from an auto-mated deduction system is to be able to offer appropriate expressions based onintuition and experience that are substituted for existentially quantified variablesso as to simplify the problem at hand substantially. We propose to simulate thisability with a technique called genetic programming for use in automated deduc-tion. We apply this approach to problems of combinatory logic. Our experimen-tal results show that the approach is viable and actually produces very promisingresults. A comparison with the renowned theorem prover Otter underlines theachievements.This work was supported by the Deutsche Forschungsgemeinschaft (DFG).
Verfasser*innenangaben: | Matthias Fuchs |
---|---|
URN: | urn:nbn:de:hbz:386-kluedo-3658 |
Schriftenreihe (Bandnummer): | SEKI Report (96,8) |
Dokumentart: | Preprint |
Sprache der Veröffentlichung: | Englisch |
Jahr der Fertigstellung: | 1996 |
Jahr der Erstveröffentlichung: | 1996 |
Veröffentlichende Institution: | Technische Universität Kaiserslautern |
Datum der Publikation (Server): | 03.04.2000 |
Fachbereiche / Organisatorische Einheiten: | Kaiserslautern - Fachbereich Informatik |
DDC-Sachgruppen: | 0 Allgemeines, Informatik, Informationswissenschaft / 004 Informatik |
Lizenz (Deutsch): | Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011 |