go-v.orgdoi

Experiments on Infinite Model Finding in SMT Solving

Julian Parsert, Chad E. Brown, Mikoláš Janota, Cezary Kaliszyk · EPiC series in computing · 2023

  • DOI 10.29007/slrm
  • Publisher EasyChair
  • Type conference-paper
  • Issued 2023

Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.

EPiC series in computing · EasyChair · conference-paper · 2023

Abstract

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.

Open the resolved locator · 10.29007/slrm

Metadata licence: OpenAlex metadata (CC0)

Registry
OpenAlex DOI index + API
Fetched
2026-11-20 17:46 UTC
Cache state
not cached yet (bulk-index+openalex)
Locator
https://easychair.org/publications/paper/TLbl
Metadata licence
OpenAlex metadata (CC0)
Scope
Metadata as returned by the resolver; abstracts are never generated here.