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”

Learning Proof Transformations and Its Applications in Interactive Theorem Proving

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21730%2F23%3A00372165" target="_blank" >RIV/68407700:21730/23:00372165 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.1007/978-3-031-43369-6_13" target="_blank" >https://doi.org/10.1007/978-3-031-43369-6_13</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-031-43369-6_13" target="_blank" >10.1007/978-3-031-43369-6_13</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Learning Proof Transformations and Its Applications in Interactive Theorem Proving

  • Original language description

    Interactive theorem provers are today increasingly used to certify mathematical theories. To formally prove a theorem, reasoning procedures called tactics are invoked successively on the proof states starting with the initial theorem statement, transforming them into subsequent intermediate goals, and ultimately discharging all proof obligations. In this work, we develop and experimentally evaluate approaches that predict the most likely tactics that will achieve particular desired transformations of proof states. First, we design several characterizations to efficiently capture the semantics of the proof transformations. Then we use them to create large datasets on which we train state-of-the-art random forests and language models. The trained models are evaluated experimentally, and we show that our best model is able to guess the right tactic for a given proof transformation in 74% of the cases. Finally, we use the trained methods in two applications: proof shortening and tactic suggesting. To the best of our knowledge, this is the first time that tactic synthesis is trained on proof transformations and assists interactive theorem proving in these ways.

  • 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

    2023

  • 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

    Frontiers of Combining Systems

  • ISBN

    978-3-031-43368-9

  • ISSN

    2945-9133

  • e-ISSN

    1611-3349

  • Number of pages

    19

  • Pages from-to

    236-254

  • Publisher name

    Springer

  • Place of publication

    Cham

  • Event location

    Praha

  • Event date

    Sep 20, 2023

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    001156327100013