On the complexity of propositional calculus formulae (Q5457670)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the complexity of propositional calculus formulae |
scientific article; zbMATH DE number 5263420
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of propositional calculus formulae |
scientific article; zbMATH DE number 5263420 |
Statements
14 April 2008
0 references
resolution algorithm
0 references
resolvents
0 references
Krom clauses
0 references
Horn clauses
0 references
0.7907018065452576
0 references
0.7791423201560974
0 references
0.7772470712661743
0 references
