Conflict-based Selection of Branching Rules in SAT-Algorithms.
Marc HerbstrittBernd BeckerPublished in: MBMV (2003)
Keyphrases
- computationally efficient
- times faster
- worst case
- neural network
- learning algorithm
- computational complexity
- computational cost
- theoretical analysis
- benchmark datasets
- stochastic local search algorithms
- bayesian networks
- search algorithm
- orders of magnitude
- first order logic
- propositional satisfiability
- satisfiability testing