paper-with-me

홈 › Papers

On the Effect of Learned Clauses on Stochastic Local Search

2020-05-07 · Jan-Hendrik Lorenz, Florian Wörz

There are two competing paradigms in successful SAT solvers: Conflict-driven clause learning (CDCL) and stochastic local search (SLS). CDCL uses systematic exploration of the search space and has the ability to learn new clauses. SLS examines the neighborhood of the current complete assignment. Unlike CDCL, it lacks the ability to learn from its mistakes. This work revolves around the question whether it is beneficial for SLS to add new clauses to the original formula. We experimentally demonstrate that clauses with a large number of correct literals w. r. t. a fixed solution are beneficial to the runtime of SLS. We call such clauses high-quality clauses. Empirical evaluations show that short clauses learned by CDCL possess the high-quality attribute. We study several domains of randomly generated instances and deduce the most beneficial strategies to add high-quality clauses as a preprocessing step. The strategies are implemented in an SLS solver, and it is shown that this considerably improves the state-of-the-art on randomly generated instances. The results are statistically significant.

📄 PDF Abstract BibTeX arXiv:2005.04022

Code (0)

등록된 구현이 없습니다.

Tasks

Attribute

Similar Papers 제목 키워드 기반

Towards Learned Clauses Database Reduction Strategies Based on Dominance Relationship

2017-05-31 · Jerry Lonlac, Engelbert Mephu Nguifo

Clause Learning is one of the most important components of a conflict driven clause learning (CDCL) SAT solver that is effective on industrial instances. Since the number of learned clauses is proved to be exponential in…

Diversity

Characterization of Glue Variables in CDCL SAT Solving

2019-04-25 · Md Solimul Chowdhury, Martin Müller, Jia-Huai You

A state-of-the-art criterion to evaluate the importance of a given learned clause is called Literal Block Distance (LBD) score. It measures the number of distinct decision levels in a given learned clause. The lower the …

Incorporating Multi-armed Bandit with Local Search for MaxSAT

2022-11-29 · Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin 외

Partial MaxSAT (PMS) and Weighted PMS (WPMS) are two practical generalizations of the MaxSAT problem. In this paper, we propose a local search algorithm for these problems, called BandHS, which applies two multi-armed ba…

Multi-Armed Bandits

A Symmetric Local Search Network for Emotion-Cause Pair Extraction

2020-12-01 · COLING 2020 8 · Zifeng Cheng, Zhiwei Jiang, Yafeng Yin, Hua Yu 외

Emotion-cause pair extraction (ECPE) is a new task which aims at extracting the potential clause pairs of emotions and corresponding causes in a document. To tackle this task, a two-step method was proposed by previous s…

Emotion-Cause Pair Extraction

A novel local search based on variable-focusing for random K-SAT

2013-10-09 · Rémi Lemoy, Mikko Alava, Erik Aurell

We introduce a new local search algorithm for satisfiability problems. Usual approaches focus uniformly on unsatisfied clauses. The new method works by picking uniformly random variables in unsatisfied clauses. A Variabl…