Satisfying versus Falsifying in Local Search for Satisfiability - (Poster Presentation)

@inproceedings{Li2012SatisfyingVF,
  title={Satisfying versus Falsifying in Local Search for Satisfiability - (Poster Presentation)},
  author={Chu Min Li and Yu Li},
  booktitle={SAT},
  year={2012}
}
During local search, clauses may frequently be satisfied or falsified. Modern SLS algorithms often exploit the falsifying history of clauses to select a variable to flip, together with variable properties such as score and age. The score of a variable x refers to the decrease in the number of unsatisfied clauses if x is flipped. The age of x refers to the number of steps done since the last time when x was flipped. Novelty [5] and Novelty based SLS algorithms consider the youngest variable in a… CONTINUE READING
15 Citations
5 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 15 extracted citations

Similar Papers

Loading similar papers…