This abstract summarizes the QSMA algorithm for satisfiability of arbitrary quantified formulas modulo a complete theory and an assignment to the free variables in the formula. It is the abstract corresponding to an invited talk.
Reasoning about quantifiers in SMT: the QSMA algorithm
Maria Paola Bonacina
2023-01-01
Abstract
This abstract summarizes the QSMA algorithm for satisfiability of arbitrary quantified formulas modulo a complete theory and an assignment to the free variables in the formula. It is the abstract corresponding to an invited talk.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
main.pdf
accesso aperto
Descrizione: Articolo
Tipologia:
Documento in Post-print
Licenza:
Creative commons
Dimensione
82.14 kB
Formato
Adobe PDF
|
82.14 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
