Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: Dempster-Pawlak modification

Sortuj według:

Ogranicz wyniki do:

Upper and Lower Set Formulas: Restriction and Modification of the Dempster-Pawlak Formalism

Turksen I. B.

International Journal of Applied Mathematics and Computer Science

2002

Vol. 12, no 3

359-369

A modification of Dempster's and Pawlak's constructs forms a new foundation for the identification of upper and lower sets formulas. Also, in this modified Dempster-Pawlak construct we require that subsets of the power set be restricted to the well-known information granules of the power set. An aggregation of upper information granules amongst each other and lower information granules amongst each other determine upper and lower set formulas for both crisp and fuzzy sets. The results are equivalent to the Truth Table derivation of FDCF and FCCF, Fuzzy Disjunctive Canonical Forms and Fuzzy Conjunctive Canonical Forms, respectively. Furthermore, they collapse to DNF \equiv CNF, i.e., the equivalence of Disjunctive Normal Forms and Conjunctive Normal Forms, in the combination of concepts once the LEM, LC and absorption, idempotency and distributivity axioms are admitted into the framework. Finally, a proof of the containment is obtained between FDCF and FCCF for the particular class of strict and nilpotent Archimedian t-norms and t-conorms.