On Simplification of Formulas with Unconstrained Variables and Quantifiers
| Authors | |
|---|---|
| Year of publication | 2017 |
| Type | Article in Proceedings |
| Conference | Theory and Applications of Satisfiability Testing – SAT 2017 |
| MU Faculty or unit | |
| Citation | |
| web | https://link.springer.com/chapter/10.1007%2F978-3-319-66263-3_23 |
| Doi | http://dx.doi.org/10.1007/978-3-319-66263-3_23 |
| Field | Informatics |
| Keywords | SMT solving; formula simplifications; bit-vectors |
| Description | Preprocessing of the input formula is an essential part of all modern smt solvers. An important preprocessing step is formula simplification. This paper elaborates on simplification of quantifier-free formulas containing unconstrained terms, i.e. terms that can have arbitrary values independently on the rest of the formula. We extend the idea in two directions. First, we introduce partially constrained terms and show some simplification rules employing this notion. Second, we show that unconstrained terms can be used also for simplification of formulas with quantifiers. Moreover, both these extensions can be merged in order to simplify partially constrained terms in formulas with quantifiers. We experimentally evaluate the proposed simplifications on formulas in the bit-vector theory. |
| Related projects: |