Heuristics Based on Unit Propagation for Satisfiability Problems.
Chu Min Li AnbulaganPublished in: IJCAI (1) (1997)
Keyphrases
- satisfiability problem
- unit propagation
- sat problem
- davis putnam
- max sat
- conjunctive normal form
- search algorithm
- clause learning
- propositional logic
- propositional satisfiability
- np complete
- temporal logic
- phase transition
- stochastic local search
- tree search
- variable ordering
- boolean satisfiability
- graph coloring
- constraint satisfaction
- computational complexity
- constraint satisfaction problems
- sat instances
- boolean formula
- model checking
- cnf formula
- learning algorithm
- special case
- tabu search
- branch and bound
- search space
- objective function