License
When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-25069
URL: https://drops.dagstuhl.de/opus/volltexte/2010/2506/
Go to the corresponding Portal |
Wille, Robert ;
Jung, Jean Christoph ;
Sülflow, Andre ;
Drechsler, Rolf
SWORD -- Module-based SAT Solving
Abstract
In the paper, SWORD is described -- a decision procedure for bit-vector logic that uses SAT techniques and exploits word level information. The main idea of SWORD is based on the following observation: While current SAT solvers perform very well on instances with a large number of logic operations, their performance on arithmetic operations degrades with increasing data-path width. In contrast, pure word-level approaches are able to handle arithmetic operations very fast, but suffer from irregularities in the word-level structure (e.g. bit slicing). SWORD tries to combine the best of both worlds: On the one hand, it includes fast propagation, sophisticated data structures, as well as advanced techniques like non-chronological backtracking and learning from modern SAT solvers. On the other hand word-level information is exploited in the decision heuristic and during propagation.
BibTeX - Entry
@InProceedings{wille_et_al:DSP:2010:2506,
author = {Robert Wille and Jean Christoph Jung and Andre S{\"u}lflow and Rolf Drechsler},
title = {SWORD -- Module-based SAT Solving},
booktitle = {Algorithms and Applications for Next Generation SAT Solvers},
year = {2010},
editor = {Bernd Becker and Valeria Bertacoo and Rolf Drechsler and Masahiro Fujita},
number = {09461},
series = {Dagstuhl Seminar Proceedings},
ISSN = {1862-4405},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2010/2506},
annote = {Keywords: SAT Solver, Word Level, SAT Modulo Theories}
}
Keywords: |
|
SAT Solver, Word Level, SAT Modulo Theories |
Collection: |
|
09461 - Algorithms and Applications for Next Generation SAT Solvers |
Issue Date: |
|
2010 |
Date of publication: |
|
17.03.2010 |