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”

ENIGMA Anonymous: Symbol-Independent Inference Guiding Machine (System Description)

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21730%2F20%3A00346051" target="_blank" >RIV/68407700:21730/20:00346051 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.1007/978-3-030-51054-1_29" target="_blank" >https://doi.org/10.1007/978-3-030-51054-1_29</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-030-51054-1_29" target="_blank" >10.1007/978-3-030-51054-1_29</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    ENIGMA Anonymous: Symbol-Independent Inference Guiding Machine (System Description)

  • Original language description

    We describe an implementation of gradient boosting and neural guidance of saturation-style automated theorem provers that does not depend on consistent symbol names across problems. For the gradient-boosting guidance, we manually create abstracted features by considering arity-based encodings of formulas. For the neural guidance, we use symbol-independent graph neural networks (GNNs) and their embedding of the terms and clauses. The two methods are efficiently implemented in the E prover and its ENIGMA learning-guided framework. To provide competitive real-time performance of the GNNs, we have developed a new context-based approach to evaluation of generated clauses in E. Clauses are evaluated jointly in larger batches and with respect to a large number of already selected clauses (context) by the GNN that estimates their collectively most useful subset in several rounds of message passing. This means that approximative inference rounds done by the GNN are efficiently interleaved with precise symbolic inference rounds done inside E. The methods are evaluated on the MPTP large-theory benchmark and shown to achieve comparable real-time performance to state-of-the-art symbol-based methods. The methods also show high complementarity, solving a large number of hard Mizar problems.

  • 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

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

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

Others

  • Publication year

    2020

  • 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

    Lecture Notes in Computer Science

  • ISBN

    978-3-030-51053-4

  • ISSN

    0302-9743

  • e-ISSN

    1611-3349

  • Number of pages

    16

  • Pages from-to

    448-463

  • Publisher name

    Springer

  • Place of publication

    Cham

  • Event location

    Paris

  • Event date

    Jun 29, 2020

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000884319500029