All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

ProofWatch: Watchlist Guidance for Large Theories in E

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F18%3A00329384" target="_blank" >RIV/68407700:21230/18:00329384 - isvavai.cz</a>

  • Alternative codes found

    RIV/68407700:21730/18:00329384

  • Result on the web

    <a href="https://link.springer.com/chapter/10.1007/978-3-319-94821-8_16" target="_blank" >https://link.springer.com/chapter/10.1007/978-3-319-94821-8_16</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-319-94821-8_16" target="_blank" >10.1007/978-3-319-94821-8_16</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    ProofWatch: Watchlist Guidance for Large Theories in E

  • Original language description

    Watchlist (also hint list) is a mechanism that allows related proofs to guide a proof search for a new conjecture. This mechanism has been used with the Otter and Prover9 theorem provers, both for interactive formalizations and for human-assisted proving of open conjectures in small theories. In this work we explore the use of watchlists in large theories coming from first-order translations of large ITP libraries, aiming at improving hammer-style automation by smarter internal guidance of the ATP systems. In particular, we (i) design watchlist-based clause evaluation heuristics inside the E ATP system, and (ii) develop new proof guiding algorithms that load many previous proofs inside the ATP and focus the proof search using a dynamically updated notion of proof matching. The methods are evaluated on a large set of problems coming from the Mizar library, showing significant improvement of E’s standard portfolio of strategies, and also of the previous best set of strategies invented for Mizar by evolutionary methods.

  • 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

    <a href="/en/project/EF15_003%2F0000466" target="_blank" >EF15_003/0000466: Artificial Intelligence and Reasoning</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2018

  • 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

    Interactive Theorem Proving

  • ISBN

    978-3-319-94820-1

  • ISSN

    0302-9743

  • e-ISSN

  • Number of pages

    19

  • Pages from-to

    270-288

  • Publisher name

    Springer

  • Place of publication

    Basel

  • Event location

    Oxford

  • Event date

    Jul 9, 2018

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article