Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning (Q3623009): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 13:04, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning |
scientific article |
Statements
Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning (English)
0 references
29 April 2009
0 references
propositional proof complexity
0 references
resolution
0 references
satisfiability
0 references
SAT solving
0 references
weakening
0 references
proof search algorithms
0 references
