Extending E Prover with Similarity Based Clause Selection Strategies
E prover is a state-of-the-art theorem prover for first-order logic with equality. E prover is built around a saturation loop, where new clauses are derived by inference rules from previously derived clauses. Selection of clauses for the inference provides the main source of non-determinism and an important choice-point of the loop where the right choice can dramatically influence the proof search. In this work we extend E Prover with several new clause selection strategies based on similarity of a clause with the conjecture. In particular, clauses which are more related to the conjecture are preferred. We implement different strategies that define the relationship with a conjecture in different ways. We provide an implementation of the proposed selection strategies and we evaluate their efficiency on an extensive benchmark set.
KeywordsAutomated theorem proving Large theory reasoning Clause selection
- 2.Kaliszyk, C., Urban, J., Vyskocil, J.: Efficient semantic features for automated reasoning over large theories. In: IJCAI, vol. 15 (2015)Google Scholar
- 7.Urban, J.: BliStr: the blind strategymaker. In: Global Conference on Artificial Intelligence, GCAI 2015, vol. 36, pp. 312–319. EasyChair (2015)Google Scholar