Cloud-Oriented SAT Solver Based on Obfuscating CNF Formula.
Ying QinShengYu ShenJingzhu KongHuadong DaiPublished in: APWeb Workshophs (2014)
Keyphrases
- sat solvers
- max sat
- cnf formula
- sat problem
- weighted max sat
- boolean formula
- sat solving
- sat instances
- propositional satisfiability
- orders of magnitude
- boolean satisfiability
- search strategies
- search space
- constraint satisfaction
- conjunctive normal form
- satisfiability problem
- np complete
- search algorithm
- branch and bound
- randomly generated
- clause learning
- constraint satisfaction problems
- phase transition
- scheduling problem
- particle swarm optimization
- propositional formulas
- tabu search