A Complete Random Jump Strategy with Guiding Paths

摘要: The restart strategy can improve the effectiveness of SAT solvers for satisfiable problems. In 2002, we proposed so-called random jump strategy, which outperformed in most experiments. One weakness shared by both and is ineffectiveness unsatisfiable problems: A job be finished a solver one day cannot not couple days if either used same solver. this paper, propose simple effective technique makes as original solvers. works follows: When from current position to another position, remember skipped search space data structure called “guiding path”. If runs out before running allotted time, recharged with saved guiding paths continues. Because overhead saving loading very small, problems when using technique.