[Zurück]

K. Hoder, G. Reger, M. Suda, A. Voronkov:
"Selecting the Selection";
Vortrag: IJCAR 2016, Coimbra; 27.06.2016 - 02.07.2016; in: "Automated Reasoning - 8th International Joint Conference, IJCAR 2016, Coimbra, Portugal, June 27 - July 2, 2016, Proceedings", Springer, LNCS 9706 (2016), ISBN: 978-3-319-40229-1; S. 313 - 329.

Modern saturation-based Automated Theorem Provers typically implement the superposition calculus for reasoning about first-order logic with or without equality. Practical implementations of this calculus use a variety of literal selections and term orderings to tame the growth of the search space and help steer proof search. This paper introduces the notion of lookahead selection that estimates (looks ahead) the effect on the search space of selecting a literal. There is also a case made for the use of incomplete selection functions that attempt to restrict the search space instead of satisfying some completeness criteria. Experimental evaluation in the \Vampire\ theorem prover shows that both lookahead selection and incomplete selection significantly contribute to solving hard problems unsolvable by other methods.

first-order theorem proving, automated theorem proving, superposition calculus, selection function

http://dx.doi.org/10.1007/978-3-319-40229-1_22

http://publik.tuwien.ac.at/files/publik_255027.pdf