Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences.
Daniel JohannsenIgor RazgonMagnus WahlströmPublished in: SAT (2009)
Keyphrases
- cnf formula
- boolean formula
- variable ordering
- max sat
- sat problem
- np complete
- weighted max sat
- conjunctive normal form
- np complete problems
- truth assignment
- sat instances
- sat solvers
- davis putnam
- satisfiability problem
- sat solving
- stochastic local search
- lower bound
- branch and bound algorithm
- knowledge compilation
- phase transition
- boolean satisfiability
- search algorithm
- propositional formulas
- combinatorial optimization
- branch and bound
- constraint satisfaction problems
- upper bound
- tabu search