On good algorithms for determining unsatisfiability of propositional formulas (Q1408376)
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 1981504
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On good algorithms for determining unsatisfiability of propositional formulas |
scientific article; zbMATH DE number 1981504 |
Statements
On good algorithms for determining unsatisfiability of propositional formulas (English)
0 references
15 September 2003
0 references
Satisfiability
0 references
Resolution
0 references
Theorem proving
0 references
Hitting set
0 references
0 references
0 references
0.8395192623138428
0 references
0.8315562009811401
0 references
0.8289154767990112
0 references
