A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Applications.
Robert CrowstonGregory Z. GutinMark JonesAnders YeoPublished in: Algorithmica (2012)
Keyphrases
- maximum number
- max sat
- lower bound
- max sat solver
- cnf formula
- unsatisfiable cores
- boolean satisfiability
- unit propagation
- branch and bound algorithm
- upper bound
- branch and bound
- weighted max sat
- random sat
- random sat instances
- objective function
- stochastic local search
- boolean formula
- np hard
- maximum satisfiability
- optimal solution
- sat solvers
- tabu search
- search space
- clause learning
- satisfiability problem
- first order logic
- column generation
- randomly generated
- finding optimal solutions