The Impact of Max-SAT Resolution-Based Preprocessors on Local Search Solvers.
Federico HerasDavid BañeresPublished in: J. Satisf. Boolean Model. Comput. (2010)
Keyphrases
- max sat
- sat solvers
- clause learning
- unit propagation
- propositional satisfiability
- sat solving
- tabu search
- maximum satisfiability
- stochastic local search
- search algorithm
- sat problem
- guided local search
- search space
- weighted max sat
- satisfiability problem
- random sat instances
- orders of magnitude
- constraint satisfaction
- lower bound
- boolean satisfiability
- search tree
- search strategies
- sat instances
- branch and bound algorithm
- branch and bound
- max sat solver
- simulated annealing
- search heuristics
- linear programming
- davis putnam
- search procedure
- sat encodings
- unsatisfiable cores
- optimal solution
- genetic algorithm
- boolean formula
- information retrieval
- temporal logic
- np complete