BliStr
| swMATH ID: | 16818 |
| Software Authors: | Urban, J. |
| Description: | BliStr: The Blind Strategymaker. BliStr is a system that automatically develops strategies for E prover on a large set of problems. The main idea is to interleave (i) iterated low-timelimit local search for new strategies on small sets of similar easy problems with (ii) higher-timelimit evaluation of the new strategies on all problems. The accumulated results of the global higher-timelimit runs are used to define and evolve the notion of ”similar easy problems”, and to control the selection of the next strategy to be improved. The technique was used to significantly strengthen the set of E strategies used by the MaLARea, PS-E, E-MaLeS, and E systems in the CASC@Turing 2012 competition, particularly in the Mizar division. Similar improvement was obtained on the problems created from the Flyspeck corpus. |
| Homepage: | http://arxiv.org/abs/1301.2683 |
| Related Software: | E Theorem Prover; VAMPIRE; MaLARea; Flyspeck; Mizar; MPTP 0.2; BliStrTune; MaLeCoP; Isabelle/HOL; MaSh; HOL Light; MoMM; Easychair; HOLyHammer; Sledgehammer; E-MaLeS; MPTP; z3; TPTP; OTTER |
| Cited in: | 22 Documents |
all
top 5
Cited by 34 Authors
all
top 5
Cited in 6 Serials
Cited in 3 Fields
| 22 | Computer science (68-XX) |
| 1 | Number theory (11-XX) |
| 1 | Geometry (51-XX) |
