The SAT problem of signed CNF formulas (Q2701980)
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 1574458
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The SAT problem of signed CNF formulas |
scientific article; zbMATH DE number 1574458 |
Statements
5 July 2001
0 references
signed conjunctive normal form
0 references
algorithms
0 references
satisfiability
0 references
signed literal
0 references
logical language for knowledge representation
0 references
The SAT problem of signed CNF formulas (English)
0 references
0.7921479940414429
0 references
0.7851371169090271
0 references
0.7625434994697571
0 references
0.7485165596008301
0 references
