A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Learning domain knowledge to improve theorem proving
[chapter]
1996
Lecture Notes in Computer Science
We present two learning inference control heuristics for equational deduction. Based on data about facts that contributed to previous proofs, evaluation functions learn to select equations that are likely to be of use in new situations. The rst evaluation function works by symbolic retrieval of generalized patterns from a knowledge base, the second function compiles the knowledge into abstract term evaluation trees. We analyze the performance of the two heuristics on a set of examples and
doi:10.1007/3-540-61511-3_69
fatcat:qh5stt4rfzdevepn27rbda5rku