A parallelization scheme based on work stealing for a class of SAT solvers
type: Item
instance of: scholarly article
title: A parallelization scheme based on work stealing for a class of SAT solvers
zbMATH Open document ID: 1086.68118
author: Bernard Jurkowiak
author: Gil Utard
author: Chu-Min Li
published in: Journal of Automated Reasoning
publication date: 2006-01-23T00:00:00Z
Mathematics Subject Classification ID: 68T15
Mathematics Subject Classification ID: 03B35
zbMATH DE Number: 5000718
zbMATH Keywords: automated theorem proving
zbMATH Keywords: SAT problem
zbMATH Keywords: parallelism
describes a project that uses: XtremWeb
describes a project that uses: UnitWalk
describes a project that uses: PSATO
describes a project that uses: Walksat
describes a project that uses: SATO
describes a project that uses: Velev SAT Benchmarks
describes a project that uses: SatEx
describes a project that uses: Chaff
describes a project that uses: SATLIB
MaRDI profile type: Publication
full work available at URL: s10817-005-1970-7
OpenAlex ID: W2079547519
cites work: A fast parallel SAT-solver -- efficient workload balancing
cites work: The complexity of theorem-proving procedures
cites work: A machine program for theorem-proving
cites work: A Computing Procedure for Quantification Theory
cites work: Q5687274
cites work: UnitWalk: A new SAT solver that uses local search guided by unit clause elimination
cites work: SATLIB: An online resource for research on SAT
cites work: Parallelizing SATZ using dynamic workload balancing
cites work: Exploiting the real power of unit propagation lookahead
cites work: A constraint-based approach to narrow search trees for satisfiability
cites work: PaSAT -- parallel SAT-checking with lemma exchange: Implementation and applications
cites work: Q2754092
cites work: PSATO: A distributed propositional prover and its application to quasigroup problems
DOI: 10.1007/S10817-005-1970-7
description: scientific article; zbMATH DE number 5000718