SIGmA: GPU Accelerated Simplification of SAT Formulas.
Muhammad OsamaAnton WijsPublished in: IFM (2019)
Keyphrases
- gpu accelerated
- quantifier free
- propositional formulas
- sat solvers
- finite element
- cnf formula
- real time
- sat problem
- boolean formula
- satisfiability problem
- phase transition
- first order logic
- search strategies
- np complete
- search algorithm
- propositional satisfiability
- conjunctive normal form
- quantifier elimination
- sat instances
- boolean satisfiability
- truth assignment
- sequence alignment
- multiresolution
- randomly chosen
- stochastic local search
- constraint programming
- sat encodings
- orders of magnitude
- rewrite systems
- random sat
- similarity measure
- neural network