Towards lightweight satisfiability solvers for self-verification

2017 ◽  
Author(s):  
Fritjof Bornebusch ◽  
Robert Wille ◽  
Rolf Drechsler
Keyword(s):  
Satisfiability Solvers

scholarly journals Software model synthesis using satisfiability solvers

2012 ◽  
Vol 18 (4) ◽  
pp. 825-856 ◽  
Author(s):  
Marijn J. H. Heule ◽  
Sicco Verwer
Keyword(s):  
Model Synthesis ◽  
Satisfiability Solvers ◽  
Software Model

scholarly journals Generic CDCL -- A Formalization of Modern Propositional Satisfiability Solvers

10.29007/7n71 ◽  
2018 ◽  
Author(s):  
Steffen Hölldobler ◽  
Norbert Manthey ◽  
Tobias Philipp ◽  
Peter Steinke
Keyword(s):  
State Transition ◽  
Transition System ◽  
Propositional Satisfiability ◽  
Sat Solvers ◽  
Satisfiability Solvers ◽  
Recent Developments ◽  
Small Set ◽  
State Transition System ◽  
Combined Algorithm ◽  
Simplification Techniques

Modern propositional satisfiability (or SAT) solvers are very powerful due to recent developments on the underlying data structures, the used heuristics to guide the search, the deduction techniques to infer knowledge, and the formula simplification techniques that are used during pre- and inprocessing. However, when all these techniques are put together, the soundness of the combined algorithm is not guaranteed any more, and understanding the complex dependencies becomes non-trivial.In this paper we present a small set of rules that allows to model modern SAT solvers in terms of a state transition system. With these rules all techniques which are applied in modern SAT solvers can be modeled adequately. Furthermore, we show that this set of rules results is sound, complete and confluent. Finnaly, we compare the proposed transition system to related systems, and show how widely used solving techniques can be modeled.

Sign in / Sign up

Export Citation Format

Share Document