Featuredbased learning of searchdguiding heuristics for theorem proving
M. Fuchs, Matthias Fuchs · AI Communications · 1998
Automated reasoning or theorem proving essentially amounts to solving search problems. Despite significant progress in recent years theorem provers still have many shortcomings. The use of machinedlearning techniques is acknowledged as promising, but difficult to apply in the area of theorem proving. We propose here to learn searchdguiding heuristics by employing features in a simple, yet effective manner. Features are used to adapt a heuristic to a solved source problem. The adapted heuristic can then be utilized profitably for solving related target problems. Experiments have demonstrated that the approach allows a theorem prover to prove hard problems that were out of reach before.