Abstract
We present two inference control heuristics for equational deduction that are based on the evaluation of previous successful proof attempts in domains of interest. The first evaluation function works by symbolic retrieval of generalized patterns from a knowledge base, and the second function compiles the knowledge into abstract term evaluation trees. Both heuristics have been implemented into the distributed equational proof system DISCOUNT. We analyze the performance of the heuristics on several sets of examples (including the subset of all unit-equality problems from the TPTP collection) and demonstrate their usefulness.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
