Coprocessor - a Standalone SAT Preprocessor

08/31/2011
by   Norbert Manthey, et al.
0

In this work a stand-alone preprocessor for SAT is presented that is able to perform most of the known preprocessing techniques. Preprocessing a formula in SAT is important for performance since redundancy can be removed. The preprocessor is part of the SAT solver riss and is called Coprocessor. Not only riss, but also MiniSat 2.2 benefit from it, because the SatELite preprocessor of MiniSat does not implement recent techniques. By using more advanced techniques, Coprocessor is able to reduce the redundancy in a formula further and improves the overall solving performance.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/10/2018

SAT solving techniques: a bibliography

We present a selective bibliography about efficient SAT solving, focused...
research
03/11/2016

Solving MaxSAT by Successive Calls to a SAT Solver

The Maximum Satisfiability (MaxSAT) problem is the problem of finding a ...
research
12/15/2017

Solving satisfiability using inclusion-exclusion

Using Maple, we implement a SAT solver based on the principle of inclusi...
research
10/30/2017

Improve SAT-solving with Machine Learning

In this project, we aimed to improve the runtime of Minisat, a Conflict-...
research
04/29/2019

QRATPre+: Effective QBF Preprocessing via Strong Redundancy Properties

We present version 2.0 of QRATPre+, a preprocessor for quantified Boolea...
research
01/30/2020

Parity (XOR) Reasoning for the Index Calculus Attack

Models for cryptographic problems are often expressed as boolean polynom...
research
03/27/2023

Verification Of Partial Quantifier Elimination

Quantifier elimination (QE) is an important problem that has numerous ap...

Please sign up or login with your details

Forgot password? Click here to reset