A backbone-search heuristic for efficient solving of hard 3-SAT formulae.
Olivier DuboisGilles DequenPublished in: IJCAI (2001)
Keyphrases
- search algorithm
- stochastic local search
- variable ordering
- search strategies
- random sat instances
- bidirectional search
- search heuristics
- search space
- search strategy
- branch and bound search
- backtracking search
- search procedure
- search procedures
- satisfiability problem
- search problems
- forward search
- solving hard
- combinatorial optimization
- heuristic search
- tree search
- depth first search
- search effort
- scheduling problem
- forward checking
- constraint satisfaction
- classical planning
- heuristic function
- search methods
- backtracking algorithm
- beam search
- finding an optimal solution
- exhaustive search
- search tree