On the Limit of Branching Rules for Hard Random Unsatisfiable 3-SAT.
Chu Min LiSylvain GérardPublished in: ECAI (2000)
Keyphrases
- random sat
- phase transition
- random instances
- sat solvers
- sat problem
- satisfiability problem
- search tree
- max sat
- boolean satisfiability
- branch and bound
- search algorithm
- randomly generated
- rule sets
- sat instances
- orders of magnitude
- propositional satisfiability
- association rules
- search strategies
- constraint satisfaction
- association rule mining
- search space
- branch and bound algorithm
- classification rules
- cnf formula
- decision rules
- np complete problems
- variable ordering
- sat solving
- davis putnam
- truth assignment