Producing proofs of unsatisfiability with distributed clause-sharing SAT solvers (Q6957142)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8065836
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Producing proofs of unsatisfiability with distributed clause-sharing SAT solvers |
scientific article; zbMATH DE number 8065836 |
Statements
Producing proofs of unsatisfiability with distributed clause-sharing SAT solvers (English)
0 references
16 July 2025
0 references
SAT solving
0 references
distributed computing
0 references
cloud computing
0 references
HPC
0 references