Abstract
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. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Li, C. M., & Li, Y. (2012). Satisfying versus falsifying in local search for satisfiability (Poster presentation). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7317 LNCS, pp. 477–478). https://doi.org/10.1007/978-3-642-31612-8_43
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
