An Incremental Abstraction Scheme for Solving Hard SMT-Instances over Bit-Vectors.
Samuel TeuberMarko Kleine BüningCarsten SinzPublished in: CoRR (2020)
Keyphrases
- solving hard
- bit vectors
- combinatorial problems
- stochastic local search
- satisfiability problem
- search problems
- propositional logic
- propositional satisfiability
- constraint programming
- sat problem
- phase transition
- randomly generated
- bit vector
- sat instances
- constraint satisfaction problems
- gray code
- heuristic search
- orders of magnitude
- np complete
- temporal logic
- search algorithm
- metaheuristic
- search space