Solving hard instances in QF-BV combining Boolean reasoning with computer algebra.
Markus WedlerEvgeny PavlenkoAlexander DreyerFrank SeelischDominik StoffelGert-Martin GreuelWolfgang KunzPublished in: Algorithms and Applications for Next Generation SAT Solvers (2009)
Keyphrases
- solving hard
- computer algebra
- propositional satisfiability
- combinatorial problems
- satisfiability problem
- automated reasoning
- stochastic local search
- theorem prover
- computer algebra systems
- search problems
- propositional logic
- sat problem
- constraint programming
- orders of magnitude
- sat solvers
- first order logic
- np complete
- sat instances
- randomly generated
- phase transition
- search algorithm
- constraint satisfaction
- knowledge representation
- theorem proving
- boolean functions
- constraint satisfaction problems
- automated theorem provers
- search space
- max sat
- heuristic search
- computational properties
- probabilistic reasoning
- traveling salesman problem
- temporal logic