Experiments on Infinite Model Finding in SMT Solving
Julian Parsert, Chad E. Brown, Mikolas Janota, Cezary Kaliszyk24th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, pp. 317-328, 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.
BibTeX
@inproceedings{jpcbmjck-lpar23,
author = {Julian Parsert and Chad E. Brown and Mikolas Janota and Cezary Kaliszyk},
editor = {Ruzica Piskac and Andrei Voronkov},
title = {Experiments on Infinite Model Finding in {SMT} Solving},
booktitle = {{LPAR} 2023: Proceedings of 24th International Conference on Logic
for Programming, Artificial Intelligence and Reasoning},
series = {EPiC},
volume = {94},
pages = {317--328},
publisher = {EasyChair},
year = {2023},
url = {https://doi.org/10.29007/slrm},
doi = {10.29007/SLRM},
}