Abstract
Our benchmark submission for the SAT 2018 Competition consist of two sets of word-level properties originally formulated as SMT problems in the quantifier-free theory of bitvectors in BTOR [1] or SMTLIB [2] format. We then use our SMT solver Boolector [3] to synthesize AIGs [4], which in turn were translated to DIMACS format.
Original language | English |
---|---|
Title of host publication | Proceedings of SAT Competition 2018 - Solver and Benchmark Descriptions |
Editors | Heule, Marijn J. H.; Järvisalo, Matti Juhani; Suda, Martin |
Place of Publication | Helsinki |
Publisher | Department of Computer Science Series of Publications B |
Pages | 56 |
Number of pages | 1 |
Volume | B-2018-1 |
Publication status | Published - 2018 |
Fields of science
- 102 Computer Sciences
- 102001 Artificial intelligence
- 102011 Formal languages
- 102022 Software development
- 102031 Theoretical computer science
- 603109 Logic
- 202006 Computer hardware
JKU Focus areas
- Computation in Informatics and Mathematics