Experiments on Infinite Model Finding in SMT Solving

Julian Parsert; Chad Brown; Mikolas Janota; Cezary Kaliszyk

doi:10.29007/slrm

Download PDF Open PDF in browser

Experiments on Infinite Model Finding in SMT Solving

12 pages•Published: June 3, 2023

Julian Parsert, Chad Brown, Mikolas Janota and Cezary Kaliszyk

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.

Keyphrases: infinite model, SMT, SyGuS

In: Ruzica Piskac and Andrei Voronkov (editors). Proceedings of 24th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, vol 94, pages 317--328

Links:	https://easychair.org/publications/paper/TLbl
	https://doi.org/10.29007/slrm

BibTeX entry

@inproceedings{LPAR2023:Experiments_on_Infinite_Model,
  author    = {Julian Parsert and Chad Brown and Mikolas Janota and Cezary Kaliszyk},
  title     = {Experiments on Infinite Model Finding in SMT Solving},
  booktitle = {Proceedings of 24th International Conference on Logic for Programming, Artificial Intelligence and Reasoning},
  editor    = {Ruzica Piskac and Andrei Voronkov},
  series    = {EPiC Series in Computing},
  volume    = {94},
  pages     = {317--328},
  year      = {2023},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {https://easychair.org/publications/paper/TLbl},
  doi       = {10.29007/slrm}}

Download PDF Open PDF in browser