Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems.
Christian DesrosiersPhilippe GalinierAlain HertzSandrine ParozPublished in: J. Comb. Optim. (2009)
Keyphrases
- satisfiability problem
- stochastic local search algorithms
- search algorithm
- solving hard
- stochastic local search
- search procedures
- temporal logic
- np complete
- phase transition
- sat problem
- pspace complete
- davis putnam
- heuristic search
- search problems
- search methods
- genetic algorithm
- max sat
- mazurkiewicz traces
- tree search
- combinatorial problems
- search tree
- search strategies
- search strategy
- branch and bound