The complexity of minimum partial truth assignments and implication in negation-free formulae (Q1380416)
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: The complexity of minimum partial truth assignments and implication in negation-free formulae |
scientific article; zbMATH DE number 1123691
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of minimum partial truth assignments and implication in negation-free formulae |
scientific article; zbMATH DE number 1123691 |
Statements
The complexity of minimum partial truth assignments and implication in negation-free formulae (English)
0 references
19 July 1998
0 references
symbolic reasoning
0 references
