BliStrTune: Hierarchical Invention of Theorem Proving Strategies
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21730%2F17%3A00318951" target="_blank" >RIV/68407700:21730/17:00318951 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1145/3018610.3018619" target="_blank" >http://dx.doi.org/10.1145/3018610.3018619</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1145/3018610.3018619" target="_blank" >10.1145/3018610.3018619</a>
Alternative languages
Result language
angličtina
Original language name
BliStrTune: Hierarchical Invention of Theorem Proving Strategies
Original language description
Inventing targeted proof search strategies for specific problem sets is a difficult task. State-of-the-art automated theorem provers (ATPs) such as E allow a large number of userspecified proof search strategies described in a rich domain specific language. Several machine learning methods that invent strategies automatically for ATPs were proposed previously. One of them is the Blind Strategymaker (BliStr), a system for automated invention of ATP strategies.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
—
Continuities
R - Projekt Ramcoveho programu EK
Others
Publication year
2017
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 6th Conference on Certified Programs and Proofs
ISBN
978-1-4503-4705-1
ISSN
—
e-ISSN
—
Number of pages
10
Pages from-to
43-52
Publisher name
ACM
Place of publication
New York
Event location
Paris
Event date
Jan 16, 2017
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000405305600006