Book Description
This thesis presents an approach to learning good search guiding heuristics for the supposition-based theorom prover E in equational deductions. Search decisions from successful proof searches are represented as sets annotated clause patterns. Term Space Mapping, an alternative learning method for recursive structures is used to learn heuristic evaluation functions for the evaluation of potential new consequences. Experimental results with extended system E/TSM show the success of the approach. Additional contributions of the thesis are an extended superposition calculus and a description of both the proof procedure and the implementation of a state-of-the-art equational theorem prover.