A New Branch and Bound Method for Incremental Satisfiability Problem.
Malek MouhoubSamira SadaouiXinkai FengPublished in: International Conference on Computational Intelligence (2004)
Keyphrases
- satisfiability problem
- branch and bound method
- branch and bound
- search algorithm
- lower bound
- np complete
- mixed integer programming
- branch and bound algorithm
- optimal configuration
- reduce the search space
- feasible solution
- phase transition
- temporal logic
- sat problem
- max sat
- stochastic local search algorithms
- stochastic local search
- search space
- column generation
- sat instances
- weighted max sat
- combinatorial optimization
- conjunctive normal form
- special case
- np hard
- data points
- search problems
- randomly generated
- knowledge representation
- bayesian networks
- upper bound
- tabu search