A parallelization scheme based on work stealing for a class of SAT solvers

DOI10.1007/s10817-005-1970-7zbMath1086.68118OpenAlexW2079547519MaRDI QIDQ812442

Gil Utard, Bernard Jurkowiak, Chu-Min Li

Publication date: 23 January 2006

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10817-005-1970-7

zbMATH Keywords

parallelismSAT problemautomated theorem proving

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35)

Related Items

HordeSat: A Massively Parallel Portfolio SAT Solver ⋮ Unnamed Item ⋮ On the van der Waerden numbers \(\mathrm{w}(2; 3, t)\)

Uses Software

• UnitWalk
• SatEx
• SATLIB
• PSATO
• Walksat
• SATO
• Chaff
• XtremWeb
• Velev SAT Benchmarks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A fast parallel SAT-solver -- efficient workload balancing
• A constraint-based approach to narrow search trees for satisfiability
• UnitWalk: A new SAT solver that uses local search guided by unit clause elimination
• PSATO: A distributed propositional prover and its application to quasigroup problems
• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving
• The complexity of theorem-proving procedures