Parallel propositional satisfiability checking with distributed dynamic learning

  title={Parallel propositional satisfiability checking with distributed dynamic learning},
  author={Wolfgang Blochinger and Carsten Sinz and Wolfgang K{\"u}chlin},
  journal={Parallel Computing},
We address the parallelization and distributed execution of an algorithm from the area of symbolic computation: propositional satisfiability (SAT) checking with dynamic learning. Our parallel programming models are strict multithreading for the core SAT checking procedure, complemented by mobile agents realizing a distributed dynamic learning process. Individual threads treat dynamically created subproblems, while mobile agents collect and distribute pertinent knowledge obtained during the… CONTINUE READING
Highly Cited
This paper has 80 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 50 extracted citations

81 Citations

Citations per Year
Semantic Scholar estimates that this publication has 81 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 34 references


  • A. S. Tanenbaum
  • van Steen, Distributed Systems––Principles and…
  • 2002
1 Excerpt


  • G. Antoniu
  • Boug"e, DSM-PM2: a portable implementation…
  • 2001
1 Excerpt


  • W. Blochinger
  • B€ undgen, A. Heinemann, Dependable high…
  • 2000
2 Excerpts

Similar Papers

Loading similar papers…