Three Truth Values for the SAT and MAX-SAT Problems.
Frédéric LardeuxFrédéric SaubionJin-Kao HaoPublished in: IJCAI (2005)
Keyphrases
- max sat
- weighted max sat
- sat solvers
- sat problem
- sat solving
- propositional satisfiability
- truth values
- maximum satisfiability
- np complete
- satisfiability problem
- graph coloring
- boolean satisfiability
- search algorithm
- branch and bound
- tabu search
- inference rules
- variable ordering
- combinatorial optimization
- optimization problems
- lower bound
- computational complexity
- randomly generated
- genetic algorithm
- sat instances
- branch and bound algorithm
- search strategies
- boolean formula
- constraint satisfaction
- orders of magnitude
- random sat instances