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”

Experiments on Infinite Model Finding in SMT Solving

The result's identifiers

  • Result code in IS VaVaI

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

  • Result on the web

    <a href="https://doi.org/10.29007/slrm" target="_blank" >https://doi.org/10.29007/slrm</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.29007/slrm" target="_blank" >10.29007/slrm</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Experiments on Infinite Model Finding in SMT Solving

  • Original language description

    We propose infinite model finding as a new task for SMT-Solving. Model finding has a long-standing tradition in SMT and automated reasoning in general. Yet, most of the current tools are limited to finite models despite the fact that many theories only admit infinite models. This paper shows a variety of such problems and evaluates synthesis approaches on them. Interestingly, state-of-the-art SMT solvers fail even on very small and simple problems. We target such problems by SyGuS tools as well as heuristic approaches.

  • 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/LL1902" target="_blank" >LL1902: Powering SMT Solvers by Machine Learning</a><br>

  • 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

    Proceedings of 24th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR)

  • ISBN

  • ISSN

    2398-7340

  • e-ISSN

    2398-7340

  • Number of pages

    12

  • Pages from-to

    317-328

  • Publisher name

    EasyChair Publications

  • Place of publication

    Manchester

  • Event location

    Manizales

  • Event date

    Jun 4, 2023

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article