Local Search for Hard SAT Formulas: The Strength of the Polynomial Law.
Sixue LiuPeriklis A. PapakonstantinouPublished in: AAAI (2016)
Keyphrases
- random sat
- truth assignment
- random sat instances
- stochastic local search
- propositional satisfiability
- search algorithm
- sat problem
- randomly chosen
- propositional formulas
- phase transition
- satisfiability problem
- satisfiability testing
- sat solvers
- max sat
- boolean satisfiability
- sat solving
- conjunctive normal form
- search strategies
- search procedures
- quantifier free
- search space
- memetic algorithm
- global search
- randomly generated
- propositional logic
- boolean formula
- combinatorial optimization
- cnf formula
- davis putnam
- genetic algorithm
- simulated annealing
- real numbers
- particle swarm optimization
- constraint satisfaction problems
- automated reasoning
- search problems
- constraint programming