On the limit of branching rules for hard random unsatisfiable 3-SAT.
Chu Min LiSylvain GérardPublished in: Discret. Appl. Math. (2003)
Keyphrases
- random sat
- phase transition
- random instances
- sat solvers
- sat problem
- satisfiability problem
- boolean satisfiability
- randomly generated
- np complete
- max sat
- search tree
- propositional satisfiability
- sat instances
- branch and bound
- stochastic local search
- boolean formula
- production rules
- search algorithm
- neural network
- constraint satisfaction
- decision rules
- graph coloring
- orders of magnitude
- rough sets
- np complete problems
- sat solving
- davis putnam
- combinatorial problems
- association rule mining
- propositional formulas
- search space
- association rules