Create a Free IGI Global Library Account to Receive a 25% Discount on All Purchases

Exclusive benefits include one-click shopping, flexible payment options, free COUNTER 4 and MARC records, and a 25% discount on all titles as well as the award-winning InfoSci^{®}-Databases.

InfoSci^{®}-Journals Annual Subscription Price for New Customers: As Low As US$ 4,950

This collection of over 175 e-journals offers unlimited access to highly-cited, forward-thinking content in full-text PDF and XML with no DRM. There are no platform or maintenance fees and a guarantee of no more than 5% increase annually.

Encyclopedia of Information Science and Technology, Fourth Edition (10 Volumes) Extended Offer

Receive the complimentary e-books for the first, second, and third editions with the purchase of the Encyclopedia of Information Science and Technology, Fourth Edition e-book. Plus, take 20% off when purchasing directly through IGI Global's Online Bookstore.

Adak, Amal Kumar, Monoranjan Bhowmik and Madhumangal Pal. "Decomposition Theorem of Generalized Interval-Valued Intuitionistic Fuzzy Sets." Contemporary Advancements in Information Technology Development in Dynamic Environments. IGI Global, 2014. 174-180. Web. 20 Mar. 2018. doi:10.4018/978-1-4666-6252-0.ch009

APA

Adak, A. K., Bhowmik, M., & Pal, M. (2014). Decomposition Theorem of Generalized Interval-Valued Intuitionistic Fuzzy Sets. In M. Khosrow-Pour (Ed.), Contemporary Advancements in Information Technology Development in Dynamic Environments (pp. 174-180). Hershey, PA: IGI Global. doi:10.4018/978-1-4666-6252-0.ch009

Chicago

Adak, Amal Kumar, Monoranjan Bhowmik and Madhumangal Pal. "Decomposition Theorem of Generalized Interval-Valued Intuitionistic Fuzzy Sets." In Contemporary Advancements in Information Technology Development in Dynamic Environments, ed. Mehdi Khosrow-Pour, 174-180 (2014), accessed March 20, 2018. doi:10.4018/978-1-4666-6252-0.ch009

In this chapter, the authors establish decomposition theorems of Generalized Interval-Valued Intuitionistic Fuzzy Sets (GIVIFS) by use of cut sets of generalized interval-valued intuitionistic fuzzy sets. First, new definitions of eight kinds of cut sets generalized interval-valued intuitionistic fuzzy sets are introduced. Second, based on these new cut sets, the decomposition generalized interval-valued intuitionistic fuzzy sets are established. The authors show that each kind of cut sets corresponds to two kinds of decomposition theorems. These results provide a fundamental theory for the research of generalized interval-valued intuitionistic fuzzy sets.

In this section, we recalled some preliminaries and the definition of IVIFS and GIVIFS.

Definition 2.1: An IVIFS A over X (universe of discourse) is an object having the form A = {〈x,M_{A}(x),N_{A}(x)〉 | x ∈ X}, where M_{A}(x): X → [I] and N_{A}(x): X → [I]. The intervals M_{A}(x) and N_{A}(x) denote the intervals of the degree of membership and degree of non-membership of the element x to the set A, where M_{A}(x) = [M_{AL}(x),M_{AU}(x)] and N_{A}(x) = [N_{AL}(x),N_{AU}(x)], for all x ∈ X, with the condition 0 ≤ M_{AU}(x)+N_{AU}(x) ≤ 1. For simplicity, we denote A = {〈x, [A^{-}(x),A^{+}(x)], [B^{-}(x),B^{+}(x)]〉 | x ∈ X}.

Definition 2.2: If the IVIFS A = {〈x,MA(x),NA(x)〉 | x ∈ X}, satisfying the condition MAU(x) ∧ NAU(x) ≤ 0.5 for all x ∈ X then A is called generalized interval-valued intuitionistic fuzzy set (GIVIFS). The condition M_{AU}(x) ∧N_{AU}(x) ≤ 0.5 is called generalized interval-valued intuitionistic fuzzy condition (GIVIFC). The maximum value of MAU(x) and N_{AU}(x) is 1.0, therefore GIVIFC imply that

0 ≤ M_{AU}(x) + N_{AU}(x) ≤ 1.5.

It may be noted that all IVIFS are GIVIFS but the converse is not true.

Let F(X) be the set of all GIVIFSs defined on X.

2.1. Some Operations on GIVIFSs

In [2], Bhowmik and Pal defined some relational operations on GIVIFSs. Let A and B be two

GIVIFSs on X, where

A = {〈[M_{AL}(x),M_{AU}], [N_{AL}(x),N_{AU}(x)]: x ∈ X〉} and
B = {〈[M_{BL}(x),M_{BU}], [N_{BL}(x),N_{BU}(x)]: x ∈ X〉}.

Then,

1.

A ⊆ B iff {(M_{AU}(x) ≤ M_{BU}(x) and M_{AL}(x) ≤ M_{BL}(x))} and{(N_{AU}(x) ≥ N_{BU}(x) and N_{AL}(x) ≥ N_{BL}(x))}, for all x ∈ X.

2.

A ∩ B = {〈[min{M_{AL}(x),M_{BL}(x)}, min{M_{AU}(x),M_{BU}(x)}],[max{N_{AL}(x),N_{BL}(x)}, max{N_{AU}(x),N_{BU}(x)}]〉: x ∈ X}.

3.

A ∪ B = {〈[max{M_{AL}(x),M_{BL}(x)}, max{M_{AU}(x),M_{BU}(x)}],[min{N_{AL}(x),N_{BL}(x)}, min{N_{AU}(x),N_{BU}(x)}]〉: x ∈ X}.