An Ising Model Inspired Extension of the Product-Based MP Framework for SAT

Gableske, Oliver

doi:10.1007/978-3-319-09284-3_27

Cited by 4 publications

(4 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The first two, WalkSAT [33] and Dimetheus [12,13], are SAT solvers, and are applied directly to the SAT problems in question (after naive clause-wise conversion to CNF). The third, Selby's solver [32], is a specialized implementation of the Hamze-de Freitas-Selby algorithm, written to solve Ising problems on D-Wave's native Chimera architecture.…”

Section: Software Solversmentioning

confidence: 99%

Constructing SAT Filters with a Quantum Annealer

Douglass

King

Raymond

2015

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. SAT filters are a novel and compact data structure that can be used to quickly query a word for membership in a fixed set. They have the potential to store more information in a fixed storage limit than a Bloom filter. Constructing a SAT filter requires sampling diverse solutions to randomly constructed constraint satisfaction instances, but there is flexibility in the choice of constraint satisfaction problem. Presented here is a case study of SAT filter construction with a focus on constraint satisfaction problems based on MAX-CUT clauses (Not-all-equal 3-SAT, 2-in-4-SAT, etc.) and frustrated cycles in the Ising model. Solutions are sampled using a D-Wave quantum annealer, and results are measured against classical approaches. The SAT variants studied are of interest in the context of SAT filters, independent of the solvers used.

show abstract

Section: Software Solversmentioning

confidence: 99%

Constructing SAT Filters with a Quantum Annealer

Douglass

King

Raymond

2015

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…The results on random benchmarks were exciting this year as the (single core) solver dimetheus (Gableske 2014a) by Oliver Gableske outperformed all other solvers, even parallel ones (which ran on twelve cores), on random benchmarks with a huge margin. dimetheus consists of two engines, one based on Message Passing (MP) (Gableske 2014b) and one based on Stochastic Local Search (SLS) (Balint and Schöning 2012). The MP engine is used to initialize the SLS engine with an "almost satisfying" assignment.…”

Section: What's Hot In Satmentioning

confidence: 99%

What's Hot in the SAT and ASP Competitions

Heule

Schaub

2015

AAAI

View full text Add to dashboard Cite

show abstract

“…For incomplete algorithms, Stochastic Local Search (SLS) solvers [CLS14, LCWS14, CLS15, LCW + 14, LHC20] and Survey Propagation (SP) solvers are very popular. SLS solvers show strong complementarity with CDCL solvers on solving a number of important application SAT instances, e.g., those instances encoded from station repacking [CZ21,FNLB16]; SP solvers show great effectiveness on solving very hugesized random 3-SAT instances (e.g., with one million variables at the clause-to-variable ratio of 4.2) [MPZ02, BMZ05,KSS12,Gab13a,Gab14,Gab13b]. This paper focuses on modern CDCL SAT solvers which are very efficient for real applications.…”

Section: Introductionmentioning

confidence: 99%

Branching Strategy Selection Approach Based on Vivification Ratio

Luo¹,

Li²,

Wu³

et al. 2021

Preprint

View full text Add to dashboard Cite

The two most effective branching strategies LRB and VSIDS perform differently on different types of instances. Generally, LRB is more effective on crafted instances, while VSIDS is more effective on application ones. However, distinguishing the types of instances is difficult. To overcome this drawback, we propose a branching strategy selection approach based on the vivification ratio. This approach uses the LRB branching strategy more to solve the instances with a very low vivification ratio. We tested the instances from the main track of SAT competitions in recent years. The results show that the proposed approach is robust and it significantly increases the number of solved instances. It is worth mentioning that, with the help of our approach, the solver Maple CM can solve more than 16 instances for the benchmark from the 2020 SAT competition.

show abstract

An Ising Model Inspired Extension of the Product-Based MP Framework for SAT

Cited by 4 publications

References 16 publications

Constructing SAT Filters with a Quantum Annealer

Constructing SAT Filters with a Quantum Annealer

What's Hot in the SAT and ASP Competitions

Branching Strategy Selection Approach Based on Vivification Ratio

Contact Info

Product

Resources

About