On the power of clause-learning SAT solvers as resolution engines (Q543613): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: BerkMin / rank | |||
Normal rank |
Revision as of 21:53, 29 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the power of clause-learning SAT solvers as resolution engines |
scientific article |
Statements
On the power of clause-learning SAT solvers as resolution engines (English)
0 references
17 June 2011
0 references
Boolean satisfiability
0 references
clause-learning SAT solvers
0 references
DPLL
0 references
proof complexity
0 references
resolution proof
0 references