2001
DOI: 10.1016/s1571-0653(04)00323-3
|View full text |Cite
|
Sign up to set email alerts
|

PaSAT — Parallel SAT-Checking with Lemma Exchange: Implementation and Applications

Abstract: We present PaSAT, a parallel implementation of a Davis-Putnam-style propositional satisfiability checker incorporating dynamic search space partitioning, intelligent backjumping, as well as lemma generation and exchange; the main focus of our implementation is on speeding up SAT-checking of propositional encodings of real-world combinatorial problems. We investigate and analyze the speed-ups obtained by parallelization in conjunction with lemma exchange and describe the effects we observed during our experimen… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
34
0

Year Published

2002
2002
2023
2023

Publication Types

Select...
4
3
1

Relationship

1
7

Authors

Journals

citations
Cited by 47 publications
(34 citation statements)
references
References 11 publications
0
34
0
Order By: Relevance
“…Since we mainly stayed within propositional (Boolean) logic, we had powerful industrial strength decision procedures at our disposal: advanced SAT-checking algorithms and normal form representations using BDDs. There is even some leeway here, because we did not have to resort to our parallel SAT-checker [30] yet. In those cases where our validation lemmas did not hold, we represented the error conditions as concise BDDs and could then trace the problem back from the model to error states of the original rule system.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…Since we mainly stayed within propositional (Boolean) logic, we had powerful industrial strength decision procedures at our disposal: advanced SAT-checking algorithms and normal form representations using BDDs. There is even some leeway here, because we did not have to resort to our parallel SAT-checker [30] yet. In those cases where our validation lemmas did not hold, we represented the error conditions as concise BDDs and could then trace the problem back from the model to error states of the original rule system.…”
Section: Resultsmentioning
confidence: 99%
“…At one time, conversion to conjunctive normal form was a real problem for BIS until a new prover [16] was developed. We also parallelized our algorithms [30], but we did not yet apply parallelism in industry.…”
Section: Industrial Experiences Summarymentioning
confidence: 99%
“…PaSAT [31] is a parallel DPLL procedure exploiting look-back techniques. It uses the same load balancing technique as PSATO but exchanges lemmas learned during the search among processors.…”
Section: Related Workmentioning
confidence: 99%
“…Thus, several distributed/parallel systematic SAT solvers have been developed such as Böhm and Speckenmeyer Parallel Solver [2], PSATO [35], PaSAT [31] and PSolver [16] to exploit the power of networked computers. In all these approaches, a formula is dynamically divided into subformulas which are then distributed among processors.…”
Section: Introductionmentioning
confidence: 99%
“…Such methods combine also with clause learning [16]. The techniques in grid-like environments have been investigated, for example, in [17,18,19,20]. The guiding path method is further developed in [21].…”
Section: Introductionmentioning
confidence: 99%