Improving Implementation of SLS Solvers for SAT and New Heuristics for k-SAT with Long Clauses.
Adrian BalintArmin BiereAndreas FröhlichUwe SchöningPublished in: SAT (2014)
Keyphrases
- stochastic local search
- sat solvers
- boolean satisfiability
- unit propagation
- solving hard
- sat problem
- clause learning
- sat solving
- propositional satisfiability
- sat instances
- sat encodings
- random sat instances
- satisfiability problem
- max sat
- maximum satisfiability
- search space
- stochastic local search algorithms
- search strategies
- search algorithm
- conjunctive normal form
- modulo theories
- computationally hard problems
- orders of magnitude
- search tree
- backtracking search
- variable ordering
- boolean formula
- combinatorial problems
- probabilistic planning
- truth assignment
- phase transition
- randomly generated
- branch and bound algorithm
- heuristic search
- np complete
- propositional formulas
- constraint programming
- pseudo boolean
- constraint satisfaction problems
- search procedures
- search heuristics
- search problems
- search strategy
- branch and bound
- constraint satisfaction
- logic programming
- lower bound