CCAnr: A Configuration Checking Based Local Search Solver for Non-random Satisfiability.
Shaowei CaiChuan LuoKaile SuPublished in: SAT (2015)
Keyphrases
- satisfiability testing
- quantified boolean formulas
- sat solving
- random sat instances
- stochastic local search
- search algorithm
- clause learning
- propositional satisfiability
- satisfiability problem
- propositional logic
- sat problem
- genetic algorithm
- boolean formula
- sat solvers
- randomly generated
- tree search
- phase transition
- global search
- simulated annealing
- random sat
- random constraint satisfaction problems
- hard constraints
- orders of magnitude
- np complete
- computational complexity
- memetic algorithm
- tabu search