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.
| Originalsprache | Englisch |
|---|---|
| Titel | Proceedings of SAT Competition 2018 - Solver and Benchmark Descriptions |
| Herausgeber*innen | Heule, Marijn J. H.; Järvisalo, Matti Juhani; Suda, Martin |
| Erscheinungsort | Helsinki |
| Verlag | Department of Computer Science Series of Publications B |
| Seiten | 56 |
| Seitenumfang | 1 |
| Band | B-2018-1 |
| Publikationsstatus | Veröffentlicht - 2018 |
Wissenschaftszweige
- 102 Informatik
- 102001 Artificial Intelligence
- 102011 Formale Sprachen
- 102022 Softwareentwicklung
- 102031 Theoretische Informatik
- 603109 Logik
- 202006 Computer Hardware
JKU-Schwerpunkte
- Computation in Informatics and Mathematics
Dieses zitieren
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver