Work

Towards Learning Infinite SMT Models (Work in Progress)

Year: 2023

Type: conference-paper

Abstract: This short paper proposes to learn models of satisfiability modulo theories (SMT) formulas during solving. Specifically, we focus on infinite models for problems in the logic of linear arithmetic with uninterpreted functions (UFLIA). The constructed models are piecewise linear. Such models are useful for satisfiable problems but also provide an alternative driver for model-based quantifier instantiation (MBQI).

Source: International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)

DOI: 10.1109/synasc61333.2023.00018

Authors: Mikoláš Janota, Bartosz Piotrowski, Karel Chvalovský

Institution: Czech Technical University in Prague

Language: English

Topic: Formal Methods in Verification

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: Ministry of Education

OpenAlex ID: W4396817955

FWCI:

Cites: 22

Cited by:

Related to: 10