Extending E Prover with Similarity Based Clause Selection Strategies

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21730%2F16%3A00309400" target="_blank" >RIV/68407700:21730/16:00309400 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-319-42547-4_11" target="_blank" >http://dx.doi.org/10.1007/978-3-319-42547-4_11</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-42547-4_11" target="_blank" >10.1007/978-3-319-42547-4_11</a>

Result language
angličtina
Original language name
Extending E Prover with Similarity Based Clause Selection Strategies
Original language description
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.
Czech name
—
Czech description
—

Publication year
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)