A unified algorithm for finding \(k\)-IESFs in linguistic truth-valued lattice-valued propositional logic (Q894383)
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: A unified algorithm for finding k-IESFs in linguistic truth-valued lattice-valued propositional logic |
scientific article; zbMATH DE number 6514849
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A unified algorithm for finding \(k\)-IESFs in linguistic truth-valued lattice-valued propositional logic |
scientific article; zbMATH DE number 6514849 |
Statements
A unified algorithm for finding \(k\)-IESFs in linguistic truth-valued lattice-valued propositional logic (English)
0 references
30 November 2015
0 references
linguistic truth-valued lattice-valued propositional logic
0 references
lattice implication algebras
0 references
\(\alpha \)-resolution
0 references
indecomposable extremely simple form (IESF)
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8223159909248352
0 references
0.7966605424880981
0 references
0.7818342447280884
0 references
0.7772337198257446
0 references
