A minimal-state processing search algorithm for satisfiability problems.
Nobuo FunabikiTokumi YokohiraTom NakanishiShigeto TajimaTeruo HigashinoPublished in: SMC (2001)
Keyphrases
- search algorithm
- satisfiability problem
- np complete
- temporal logic
- search space
- stochastic local search
- max sat
- heuristic search
- search strategy
- stochastic local search algorithms
- solving hard
- sat instances
- state space
- search strategies
- search methods
- sat problem
- tabu search
- orders of magnitude
- dynamic programming
- lower bound