Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning (Q3623009): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q124817153, #quickstatements; #temporary_batch_1714779566367 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.2168/lmcs-4(4:13)2008 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3100513773 / rank | |||
Normal rank | |||
Latest revision as of 10:46, 30 July 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
