A unified algorithm for finding \(k\)-IESFs in linguistic truth-valued lattice-valued propositional logic (Q894383): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00500-013-1188-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1983381099 / rank | |||
Normal rank | |||
Revision as of 21:15, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A unified algorithm for finding \(k\)-IESFs in linguistic truth-valued lattice-valued propositional logic |
scientific article |
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
