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 Guided Automated Reasoning: A Brief Survey

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F24%3A00584859" target="_blank" >RIV/67985807:_____/24:00584859 - isvavai.cz</a>

  • Alternative codes found

    RIV/68407700:21730/24:00380966

  • Result on the web

    <a href="https://doi.org/10.1007/978-3-031-61716-4_4" target="_blank" >https://doi.org/10.1007/978-3-031-61716-4_4</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-031-61716-4_4" target="_blank" >10.1007/978-3-031-61716-4_4</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Learning Guided Automated Reasoning: A Brief Survey

  • Original language description

    Automated theorem provers and formal proof assistants are general reasoning systems that are in theory capable of proving arbitrarily hard theorems, thus solving arbitrary problems reducible to mathematics and logical reasoning. In practice, such systems however face large combinatorial explosion, and therefore include many heuristics and choice points that considerably influence their performance. This is an opportunity for trained machine learning predictors, which can guide the work of such reasoning systems. Conversely, deductive search supported by the notion of logically valid proof allows one to train machine learning systems on large reasoning corpora. Such bodies of proof are usually correct by construction and when combined with more and more precise trained guidance they can be boostrapped into very large corpora, with increasingly long reasoning chains and possibly novel proof ideas. In this paper we provide an overview of several automated reasoning and theorem proving domains and the learning and AI methods that have been so far developed for them. These include premise selection, proof guidance in several settings, AI systems and feedback loops iterating between reasoning and learning, and symbolic classification problems.

  • Czech name

  • Czech description

Classification

  • Type

    C - Chapter in a specialist book

  • 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

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2024

  • 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

  • Book/collection name

    Logics and Type Systems in Theory and Practice. Essays in Honor of the 60th Birthday of Herman Geuvers

  • ISBN

    978-3-031-61715-7

  • Number of pages of the result

    30

  • Pages from-to

    54-83

  • Number of pages of the book

    273

  • Publisher name

    Springer

  • Place of publication

    Cham

  • UT code for WoS chapter

    001283291600005