Monte carlo tableau proof search
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21730%2F17%3A00318994" target="_blank" >RIV/68407700:21730/17:00318994 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-319-63046-5_34" target="_blank" >http://dx.doi.org/10.1007/978-3-319-63046-5_34</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-63046-5_34" target="_blank" >10.1007/978-3-319-63046-5_34</a>
Alternative languages
Result language
angličtina
Original language name
Monte carlo tableau proof search
Original language description
We study Monte Carlo Tree Search to guide proof search in tableau calculi. This includes proposing a number of proof-state evaluation heuristics, some of which are learnt from previous proofs. We present an implementation based on the leanCoP prover. The system is trained and evaluated on a large suite of related problems coming from the Mizar proof assistant, showing that it is capable to find new and different proofs.
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
CADE 26 - 26th International Conference on Automated Deduction
ISBN
978-3-319-63045-8
ISSN
0302-9743
e-ISSN
—
Number of pages
17
Pages from-to
563-579
Publisher name
Springer
Place of publication
Basel
Event location
Gothenburg
Event date
Aug 6, 2017
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—