Selecting Quantifiers for Instantiation in SMT
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21730%2F23%3A00372219" target="_blank" >RIV/68407700:21730/23:00372219 - isvavai.cz</a>
Result on the web
<a href="https://ceur-ws.org/Vol-3429/short10.pdf" target="_blank" >https://ceur-ws.org/Vol-3429/short10.pdf</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Selecting Quantifiers for Instantiation in SMT
Original language description
This work attempts to choose quantifiers to instantiate based on a feedback from the SMT solver. This tackles the challenge that if a problem contains many quantifier expressions, it eventually gets flooded by too many generated ground terms. Therefore, we instantiate only some of the quantifiers but the question is, which are the useful ones? The SMT solver is modeled as a multi-armed bandit, where each quantifier is a lever producing a positive reward if an instantiation of the quantifier was useful. The issue is that we do not know whether an instantiation was useful or not until the given problem instance is actually proven (and then it’s too late). In this paper we explore several heuristics that attempt to assess the usefulness of quantifier instantiations.
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
Result was created during the realization of more than one project. More information in the Projects tab.
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 the 21st International Workshop on Satisfiability Modulo Theories (SMT 2023) co-located with the 29th International Conference on Automated Deduction (CADE 2023)
ISBN
—
ISSN
1613-0073
e-ISSN
1613-0073
Number of pages
7
Pages from-to
71-77
Publisher name
CEUR Workshop Proceedings
Place of publication
Aachen
Event location
Řím
Event date
Jul 5, 2023
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—