A randomized diversification strategy for solving satisfiability problem with long clauses.

Jian Gao Ruizhi Li Minghao Yin

Published in: Sci. China Inf. Sci. (2017)

Keyphrases

satisfiability problem
random sat
solving hard
stochastic local search
sat instances
np complete
conjunctive normal form
temporal logic

finite domain
davis putnam logemann loveland
search algorithm
stochastic local search algorithms
phase transition
sat problem
weighted max sat
systematic search algorithms

clause learning
pspace complete
tabu search
max sat
cnf formula
boolean formula
search space
search strategies

combinatorial optimization
graph coloring problems
boolean satisfiability
search strategy
first order logic
objective function
genetic algorithm