AI Chat AI Image Generator AI Video Text to Speech

SAT solving techniques: a bibliography

02/10/2018

∙

We present a selective bibliography about efficient SAT solving, focused on optimizations for the CDCL-based algorithms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research

∙ 06/08/2010

New worst upper bound for #SAT

The rigorous theoretical analyses of algorithms for #SAT have been propo...

0 Junping Zhou, et al. ∙

research

∙ 08/31/2011

Coprocessor - a Standalone SAT Preprocessor

In this work a stand-alone preprocessor for SAT is presented that is abl...

0 Norbert Manthey, et al. ∙

research

∙ 12/04/2019

Prioritized Unit Propagation with Periodic Resetting is (Almost) All You Need for Random SAT Solving

We propose prioritized unit propagation with periodic resetting, which i...

0 Xujie Si, et al. ∙

research

∙ 05/13/2022

Scalable SAT Solving in the Cloud

Previous efforts on making Satisfiability (SAT) solving fit for high per...

0 Dominik Schreiber, et al. ∙

research

∙ 04/04/2022

Reducing SAT to Max2XOR

Representing some problems with XOR clauses (parity constraints) can all...

0 Carlos Ansótegui, et al. ∙

research

∙ 03/11/2016

Solving MaxSAT by Successive Calls to a SAT Solver

The Maximum Satisfiability (MaxSAT) problem is the problem of finding a ...

0 Mohamed El Halaby, et al. ∙

research

∙ 08/05/2020

A Time Leap Challenge for SAT Solving

We compare the impact of hardware advancement and algorithm advancement ...

1 Johannes K. Fichte, et al. ∙

SAT solving techniques: a bibliography

Related Research

New worst upper bound for #SAT

Coprocessor - a Standalone SAT Preprocessor

Prioritized Unit Propagation with Periodic Resetting is (Almost) All You Need for Random SAT Solving

Scalable SAT Solving in the Cloud

Reducing SAT to Max2XOR

Solving MaxSAT by Successive Calls to a SAT Solver

A Time Leap Challenge for SAT Solving