A Max-SAT Inference-Based Pre-processing for Max-Clique.
Federico HerasJavier LarrosaPublished in: SAT (2008)
Keyphrases
- max sat
- preprocessing
- weighted max sat
- sat solvers
- lower bound
- tabu search
- search algorithm
- branch and bound
- branch and bound algorithm
- sat problem
- satisfiability problem
- maximum satisfiability
- constraint satisfaction
- cnf formula
- stochastic local search
- unsatisfiable cores
- boolean satisfiability
- bayesian networks
- neural network
- variable ordering
- genetic algorithm
- efficient learning
- search methods
- orders of magnitude
- constraint satisfaction problems
- simulated annealing
- random sat instances
- max sat solver