Computational complexity of infinite-valued Łukasiewicz propositional logic (Q2784792)
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: Computational complexity of infinite-valued Łukasiewicz propositional logic |
scientific article; zbMATH DE number 1733008
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational complexity of infinite-valued Łukasiewicz propositional logic |
scientific article; zbMATH DE number 1733008 |
Statements
25 July 2002
0 references
infinite-valued Łukasiewicz propositional logic
0 references
consequence relation
0 references
NP-completeness
0 references
satisfiability problem
0 references
Computational complexity of infinite-valued Łukasiewicz propositional logic (English)
0 references
0.8514349460601807
0 references
0.8444409966468811
0 references
0.830861508846283
0 references
0.8304847478866577
0 references
0.8200258612632751
0 references
