Unsatisfiability proofs for distributed clause-sharing SAT solvers
type: Item
instance of: scholarly article
title: Unsatisfiability proofs for distributed clause-sharing SAT solvers
zbMATH Open document ID: 1543.68256
DOI: 10.1007/978-3-031-30823-9_18
author: Dawn Michaelson
author: Dominik Schreiber
author: Marijn J. H. Heule
author: Benjamin Kiesl-Reiter
author: Michael W. Whalen
publication date: 2023-12-13T00:00:00Z
Mathematics Subject Classification ID: 68R07
Mathematics Subject Classification ID: 68V15
zbMATH DE Number: 7777313
zbMATH Keywords: SAT solving
zbMATH Keywords: distributed computing
MaRDI profile type: Publication
cites work: Lazy Clause Exchange Policy for Parallel SAT Solvers
cites work: SAT competition 2020
cites work: HordeSat: A Massively Parallel Portfolio SAT Solver
cites work: Q5503674
cites work: Space/time trade-offs in hash coding with allowable errors
cites work: The resolution of Keller's conjecture
cites work: Efficient certified RAT verification
cites work: Algorithm portfolios
cites work: Q3639756
cites work: Efficient, verified checking of propositional proofs
cites work: Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
cites work: Inprocessing Rules
cites work: Efficient verified (UN)SAT certificate checking
cites work: Decentralized Online Scheduling of Malleable NP-hard Jobs
cites work: Scalable SAT solving in the cloud
cites work: Q3639754
cites work: \texttt{cake\_lpr}: verified propagation redundancy checking in CakeML
cites work: Q3624141
description: scientific article; zbMATH DE number 7777313