Local lemma: a new strategy of pruning in SAT solvers

Authors:
Xiangxue Jia;Runming Lu;Sheng Liu;Jian Zhang
Affiliations:
Graduate University, Chinese Academy of Sciences;Graduate University, Chinese Academy of Sciences;Graduate University, Chinese Academy of Sciences;Institute of Software, Chinese Academy of Sciences
Venue:
Proceedings of the 2010 ACM Symposium on Applied Computing
Year:
2010

Citing 2
Cited 0

Using Problem Symmetry in Search Based Satisfiability Algorithms

Proceedings of the conference on Design, automation and test in Europe
Efficient SAT solving: beyond supercubes

Proceedings of the 42nd annual Design Automation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a search tree pruning strategy for SAT solving. It is called Local Lemma, because it generates lemmas from explored subtrees and these lemmas are valid only in a part of the search tree. The paper explains the basic principle of the strategy, illustrates it with an example, and presents some experimental results.