Read-Once Resolution for Unsatisfiability-Based Max-SAT Algorithms.
Federico HerasJoão Marques-SilvaPublished in: IJCAI (2011)
Keyphrases
- max sat
- exact algorithms
- stochastic local search
- maximum satisfiability
- lower bound
- search algorithm
- orders of magnitude
- weighted max sat
- sat solvers
- branch and bound algorithm
- strongly connected components
- neural network
- branch and bound
- tabu search
- satisfiability problem
- sat problem
- variable ordering
- unit propagation
- data structure
- simulated annealing
- learning algorithm
- optimization problems
- special case
- computational complexity
- boolean satisfiability
- objective function