The complexity of minimum partial truth assignments and implication in negation-free formulae (Q1380416): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02136174 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2005967372 / rank | |||
Normal rank | |||
Latest revision as of 10:47, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of minimum partial truth assignments and implication in negation-free formulae |
scientific article |
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
