0 Up votes0 Down votes

1 views12 pagestIn this paper, we introduce concept of possibility neutrosophic soft set and define some related conceptssuch as possibility neutrosophic soft subset, possibility neutrosophic soft null set, and possibility neutro-sophic soft universal set. Then, based on definitions of n-norm and n-conorm, we define set theoreticaloperations of possibility neutrosophic soft sets such as union, intersection and complement, and inves-tigate some properties of these operations. We also introduce AND-product and OR-product operationsbetween two possibility neutrosophic soft sets. We propose a decision making method called possibil-ity neutrosophic soft decision making method (PNS-decision making method) which can be applied tothe decision making problems involving uncertainty based on AND-product operation. We finally give anumerical example to display application of the method that can be successfully applied to the problems.

Nov 03, 2017

© © All Rights Reserved

PDF, TXT or read online from Scribd

tIn this paper, we introduce concept of possibility neutrosophic soft set and define some related conceptssuch as possibility neutrosophic soft subset, possibility neutrosophic soft null set, and possibility neutro-sophic soft universal set. Then, based on definitions of n-norm and n-conorm, we define set theoreticaloperations of possibility neutrosophic soft sets such as union, intersection and complement, and inves-tigate some properties of these operations. We also introduce AND-product and OR-product operationsbetween two possibility neutrosophic soft sets. We propose a decision making method called possibil-ity neutrosophic soft decision making method (PNS-decision making method) which can be applied tothe decision making problems involving uncertainty based on AND-product operation. We finally give anumerical example to display application of the method that can be successfully applied to the problems.

© All Rights Reserved

1 views

tIn this paper, we introduce concept of possibility neutrosophic soft set and define some related conceptssuch as possibility neutrosophic soft subset, possibility neutrosophic soft null set, and possibility neutro-sophic soft universal set. Then, based on definitions of n-norm and n-conorm, we define set theoreticaloperations of possibility neutrosophic soft sets such as union, intersection and complement, and inves-tigate some properties of these operations. We also introduce AND-product and OR-product operationsbetween two possibility neutrosophic soft sets. We propose a decision making method called possibil-ity neutrosophic soft decision making method (PNS-decision making method) which can be applied tothe decision making problems involving uncertainty based on AND-product operation. We finally give anumerical example to display application of the method that can be successfully applied to the problems.

© All Rights Reserved

- The Law of Explosive Growth: Lesson 20 from The 21 Irrefutable Laws of Leadership
- Hidden Figures: The American Dream and the Untold Story of the Black Women Mathematicians Who Helped Win the Space Race
- Hidden Figures Young Readers' Edition
- The E-Myth Revisited: Why Most Small Businesses Don't Work and
- Micro: A Novel
- The Wright Brothers
- The Other Einstein: A Novel
- State of Fear
- State of Fear
- The Power of Discipline: 7 Ways it Can Change Your Life
- The Kiss Quotient: A Novel
- Being Wrong: Adventures in the Margin of Error
- Algorithms to Live By: The Computer Science of Human Decisions
- The 6th Extinction
- The Black Swan
- The Art of Thinking Clearly
- The Last Battle
- Prince Caspian
- A Mind for Numbers: How to Excel at Math and Science Even If You Flunked Algebra
- The Theory of Death: A Decker/Lazarus Novel

You are on page 1of 12

journal homepage: www.elsevier.com/locate/asoc

Faruk Karaaslan

Department of Mathematics, Faculty of Sciences, Cankr Karatekin University, 18100 Cankr, Turkey

a r t i c l e i n f o a b s t r a c t

Article history: In this paper, we introduce concept of possibility neutrosophic soft set and dene some related concepts

Received 10 June 2015 such as possibility neutrosophic soft subset, possibility neutrosophic soft null set, and possibility neutro-

Received in revised form 29 June 2016 sophic soft universal set. Then, based on denitions of n-norm and n-conorm, we dene set theoretical

Accepted 4 July 2016

operations of possibility neutrosophic soft sets such as union, intersection and complement, and inves-

Available online 15 July 2016

tigate some properties of these operations. We also introduce AND-product and OR-product operations

between two possibility neutrosophic soft sets. We propose a decision making method called possibil-

Keywords:

ity neutrosophic soft decision making method (PNS-decision making method) which can be applied to

Soft set

Neutrosophic set

the decision making problems involving uncertainty based on AND-product operation. We nally give a

Neutrosophic soft set numerical example to display application of the method that can be successfully applied to the problems.

Possibility neutrosophic soft set 2016 Elsevier B.V. All rights reserved.

Decision making

1. Introduction

Many problems in engineering, medical sciences, economics and social sciences involve uncertainty. Researchers have proposed some

theories such as the theory of fuzzy set [34], the theory of intuitionistic fuzzy set [5], the theory of rough set [26], the theory of vague set

[19] in order to resolve these problems. However, all of these theories have their own difculties which are pointed out by Molodtsov

[21]. Therefore, he proposed a completely new approach for modeling uncertainty. Molodtsov displayed soft sets in wide range of eld

including the smoothness of functions, game theory, operations research, Riemann integration, Perron integration, probability theory and

measurement theory. After Molodtsovs study [21], the operations of soft sets and some of their properties were given by Maji et al. [24].

Some researchers such as Ali et al. [1], Cagman and Enginoglu [9], Sezgin and Atagn [30], Zhu and Wen [36], Cagman [12] made some

modications and contributions to the operations of soft sets.

Application of soft set theory in decision making problems was rst studied by Maji et al. [23]. Subsequent works were published by

many researchers. Cagman and Enginoglu [9] proposed the uni-int decision making method to reduce the alternatives. Feng et al. [17]

generalized the uni-int decision making based on choice value soft sets. Qin et al. [27] improved some algorithms which require relatively

fewer calculations compared with the existing decision making algorithms. Zhi et al. [35] presented an efcient decision making approach

in incomplete soft set.

In 1986, intuitionistic fuzzy sets were introduced by Atanassov [3] as an extension of Zadehs [34] notion of fuzzy set. Maji [22] combined

intuitionistic fuzzy with soft sets. Cagman and Karatas [11] redened intuitionistic fuzzy sets and proposed a decision making method using

the intuitionistic fuzzy soft sets. Agarwal et al. [2] dened generalized intuitionistic fuzzy soft sets (GIFSS), and investigated properties

of GIFSS. They also put forward similarity measure between two GIFSSs. Das and Kar [13] proposed an algorithmic approach based on

intuitionistic fuzzy soft set (IFSS) which explores a particular disease reecting the agreement of all experts. They also demonstrated

effectiveness of the proposed approach using a suitable case study. Deli and Cagman [16] dened intuitionistic fuzzy parameterized

soft sets as an extension of fuzzy parameterized soft sets [10], and suggested a decision making method based on intuitionistic fuzzy

parameterized soft sets. Recently, many researchers published interesting results on intuitionistic fuzzy soft set theory.

Neutrosophic logic theory and neutrosophic sets were proposed by Smarandache [31,32], as a new mathematical tool for dealing with

problems involving incomplete, indeterminant, and inconsistent knowledge. Neutrosophy is a new branch of philosophy that generalizes

fuzzy logic, intuitionistic fuzzy logic, and paraconsistent logic. Fuzzy sets are characterized by membership functions, and intuitionistic

fuzzy sets by membership functions and non-membership functions. In some real life problems for proper description of an object in

http://dx.doi.org/10.1016/j.asoc.2016.07.013

1568-4946/ 2016 Elsevier B.V. All rights reserved.

404 F. Karaaslan / Applied Soft Computing 54 (2017) 403414

uncertain and ambiguous environment, we need to discuss the indeterminate and incomplete information. However, fuzzy sets and

intuitionistic fuzzy sets do not discuss the indeterminant and inconsistent information.

Maji [25] introduced concept of neutrosophic soft set and some operations of neutrosophic soft sets. Then Karaaslan [20] redened

concepts and operations on neutrosophic soft sets. He also gave a decision making method and group decision making method. Recently, the

properties of neutrosophic soft sets and applications in decision making problems have been studied increasingly. For example, Broumi

[7] dened concept of generalized neutrosophic soft set. Broumi et al. [8] suggested a decision making method on the neutrosophic

parameterized soft sets. Sahin and Kck [29] introduced concept of generalized neutrosophic soft sets and their operations. They also

proposed decision making method and similarity measure method under generalized soft neutrosophic environment. Deli [14] dened

concept of interval-valued neutrosophic soft set and its operations. Deli and Broumi [15] introduced neutrosophic soft matrices and

suggested a decision making method based on neutrosophic soft matrices.

Alkhazaleh et al. [4] rst introduced concept of the possibility fuzzy soft sets and their operations, and gave applications of this theory

in a decision making problem. They also introduced a similarity measure between two possibility fuzzy soft sets, and gave an application of

proposed similarity measure method in a medical diagnosis problem. In 2012, Bashir et al. [6] introduced concept of possibility intuitionistic

fuzzy soft set and their operations, and discussed similarity measure between two possibility intuitionistic fuzzy sets. They also gave an

application of this similarity measure.

Possibility neutrosophic soft sets are generalization of possibility fuzzy soft sets and possibility intuitionistic fuzzy soft sets. Fuzzy sets

and intuitionistic fuzzy sets are very useful in order to model some decision making problems containing uncertainty and incomplete

information. However, they sometimes may not sufce to model indeterminate and inconsistent information encountered in real world.

This problem also exists in fuzzy soft sets and intuitionistic fuzzy soft sets. Therefore, concepts of neutrosophic set and neutrosophic soft

set have a very important role in modeling of some problems which contain indeterminate and inconsistent information. In the denition

of neutrosophic soft set [20,25], parameter set is a classical set, and possibility of each element of initial universe related to each parameter

are considered as 1. This poses a limitation in modeling of some problems. In a possibility neutrosophic soft set, possibility of each element

of initial universe related to each parameter may be different from 1. Therefore, possibility neutrosophic soft sets present a more general

perspective than neutrosophic soft sets. If we are to explain the idea of possibility neutrosophic soft set, let us give an example, consider the

last ten days of April and the parameter rainy. First day of last ten days, the possibility of action of rainfall can be 0.8. However, amount

of water can be (0.5, 0.3, 0.6). Based on the parameter rainy, other nine days can be expressed with some possibility neutrosophic values.

For last ten days and for parameters more than one, we need possibility neutrosophic soft sets to show all of the corresponding possibility

neutrosophic values.

From this point of view, we introduce concept of possibility neutrosophic soft sets based on idea that each of elements of initial

universe has got a possibility degree related to each element of parameter set. Furthermore, we dene set theoretical operations between

two possibility neutrosophic soft sets, and investigate some of their properties. We also propose a new decision making method using

AND-product of possibility neutrosophic soft sets called possibility neutrosophic soft(PNS) decision making method. We nally give a

numerical example to show the method that can be successfully applied to the problems studied.

2. Preliminary

We rst present basic denitions and propositions required in next sections. The concepts given in this section can be found in Refs.

[4,6,12,20,21,25].

Throughout this paper U is an initial universe, E is a set of parameters, P(U) is power set of U and is an index set.

/ A E. Mapping given by f : A P(U) is called a soft set over

U and denoted by (f, A).

Let f and g be two soft sets. Then,

1. If f(e) = for all e E, then f is called null soft set and denoted by .

2. If f(e) = U for all e E, then f is called absolute soft set and denoted by U.

3. If f(e) g(e) for all e E, f is said to be a soft subset of g and denoted by f g.

4. If f g

and g f , f = g.

5. Soft union of f and g, denoted by f g, is a soft set over U and dened by f g : E P(U) such that (f g)(e)

= f (e) g(e) for all e E.

6. Soft intersection of f and g, denoted by f g, is a soft set over U and dened by f g

: E P(U) such that (f g)(e)

= f (e) g(e) for all e E.

7. Soft complement of f is denoted by f c and dened by f c : E P(U) such that f c (e) = U\f (e) for all e E.

Denition 2 ([20,25]). A neutrosophic soft set (or namely ns-set) f over U is a neutrosophic set valued function from E to N(U). It can be

written as

where, N(U) denotes set of all neutrosophic sets over U. Here, each of tf(e) , if(e) and ff(e) is a function from U to interval [0, 1] and they denote

truth, indeterminacy and falsity membership degrees of element of initial universe U related to parameter e E, respectively. Note that if

f(e) = {u, 0, 1, 1 : u U}, the element (e, f(e)) is not appeared in the neutrosophic soft set f. Set of all ns-sets over U is denoted by NS.

Denition 3 ([20]). Let f, g NS. f is said to be neutrosophic soft subset of g, if tf(e) (u) tg(e) (u), if(e) (u) ig(e) (u)ff(e) (u) fg(e) (u), e E,

u U. We denote it by f
g. f is said to be neutrosophic soft super set of g if g is a neutrosophic soft subset of f. We denote it by f g.

If f is neutrosophic soft subset of g and g is neutrosophic soft subset of f. We denote it f = g. Here, if we take if(e) (u) ig(e) (u), it can be

shown that the denition is identical to denition of neutrosophic soft subset given by Maji [25].

F. Karaaslan / Applied Soft Computing 54 (2017) 403414 405

Denition 4 ([20]). Let f NS. If tf(e) (u) = 0 and if(e) (u) = ff(e) (u) = 1 for all e E and for all u U, then f is called null ns-set and denoted by

Denition 5 ([20]). Let f NS. If tf(e) (u) = 1 and if(e) (u) = ff(e) (u) = 0 for all e E and for all u U, then f is called universal ns-set and denoted

by U.

Denition 6 ([20]). Let f, g NS. Then union and intersection of ns-sets f and g denoted by f g and f g respectively, are dened by as

follows:

f g = {(e, {u, tf (e) (u) tg(e) (u), if (e) (u) ig(e) (u), ff (e) (u) fg(e) (u) : u U}) : e E}.

f g = {(e, {u, tf (e) (u) tg(e) (u), if (e) (u) ig(e) (u), ff (e) (u) fg(e) (u) : u U}) : e E}.

Denition 7 ([20]). Let f, g NS. Then complement of ns-set f, denoted by f c , is dened as follows:

f c = {(e, {u, ff (e) (u), 1 if (e) (u), tf (e) (u) : u U}) : e E}.

(1)
f

(2) f
U

(3) f
f

(4) f
g and g
h f
h

(1) c = U

(2) U c =

c

(3) (f c ) = f .

(1) f f = f and f f = f

(2) f g = g f and f g = g f

(3) f = and f U = f

(4) f = f and f U = U

(5) f (g h) = (f g) h and f (g h) = (f g) h

(6) f (g h) = (f g) (f h) and f (g h) = (f g) (f h).

c

(1) (f g) = f c g c

c

(2) (f g) = f c g c

Denition 8 ([20]). Let f, g NS. Then OR product of ns-sets f and g denoted by f g, is dened as follows:

f g = {((e, e ), {u, tf (e) (u) tg(e) (u), if (e) (u) ig(e) (u), ff (e) (u) fg(e) (u) : u U}) : (e, e ) E E}.

Denition 9 ([20]). Let f, g NS. Then AND product of ns-sets f and g denoted by f g, is dened as follows:

f g = {((e, e ), {u, tf (e) (x) tg(e) (u), if (e) (u) ig(e) (u), ff (e) (u) fg(e) (u) : u U}) : (e, e ) E E}.

c

(1) (f g) = f c g c

c

(2) (f g) = f c g c

Denition 10 ([4]). Let U = {u1 , u2 , . . ., un } be the universal set of elements and E = {e1 , e2 , . . ., em } be the universal set of parameters. The

pair (U, E) will be called a soft universe. Let F : E IU and be a fuzzy subset of E, that is : E IU , where IU is the collection of all fuzzy

subsets of U. Let F : E IU IU be a function dened as follows:

Then F is called a possibility fuzzy soft set (PFSS in short) over the soft universe (U, E). For each parameter ei , F (ei ) = (F(ei )(u), (ei )(u))

indicates not only the degree of belongingness of the elements of U in F(ei ), but also the degree of possibility of belongingness of the

elements of U in F(ei ), which is represented by (ei ).

406 F. Karaaslan / Applied Soft Computing 54 (2017) 403414

Denition 11 ([6]). Let U = {u1 , u2 , . . ., un } be the universal set of elements and E = {e1 , e2 , . . ., em } be the universal set of parameters. The

pair (U, E) will be called a soft universe. Let F : E (I I)U IU where (I I)U is the collection of all intuitionistic fuzzy subsets of U and IU

is the collection of all fuzzy subsets of U. Let p be a fuzzy subset of E, that is, p : E IU and let Fp : E (I I)U IU be a function dened as

follows:

Then Fp is called a possibility intuitionistic fuzzy soft set (PIFSS in short) over the soft universe (U, E). For each parameter ei ,

Fp (ei ) = (F(ei )(u), p(ei )(u)) indicates not only the degree of belongingness of the elements of U in F(ei ), but also the degree of possibility

of belongingness of the elements of U in F(ei ), which is represented by p(ei ).

In this section, we introduce the concepts of possibility neutrosophic soft set, possibility neutrosophic soft subset, possibility neutro-

sophic soft null set, possibility neutrosophic soft universal set, and possibility neutrosophic soft set operations.

Denition 12. Let U be an initial universe, E be a parameter set, N(U) be the collection of all neutrosophic sets of U and IU is collection of

all fuzzy subset of U. A possibility neutrosophic soft set (PNS set)f over U is a set of ordered pairs dened by

uj

f = ek , , (ek )(uj ) : uj U : ek E

f (ek )(uj )

or a mapping dened by

f : E N(U) I U

where, i 1 and j 2 , f is a mapping given by f : E N(U) and (ek ) is a fuzzy set such that : E IU .

For each parameter ek E, f (ek ) = {uj , tf (ek ) (uj ), if (ek ) (uj ), ff (ek ) (uj ) : uj U} indicates neutrosophic value set of parameter ek and where

t, i, f : U [0, 1] are the membership functions of truth, indeterminacy and falsity respectively of the element uj U. For each uj U and

ek E, 0 tf (ek ) (uj ) + if (ek ) (uj ) + ff (ek ) (uj ) 3. Also (ek ), degrees of possibility of belongingness of elements of U in f(ek ). So we can write

u1

u2

un

f (ek ) = , (ek )(u1 ) , , (ek )(u2 ) , . . ., , (ek )(un )

f (ek )(u1 ) f (ek )(u2 ) f (ek )(un )

From now on, we will show set of all possibility neutrosophic soft sets over U with PN(U, E) such that E is parameter set.

Example 1. Let U = {u1 , u2 , u3 } be a set of three cars. Let E = {e1 , e2 , e3 } be a set of qualities where e1 = cheap, e2 = equipment, e3 = fuel

consumption and let : E IU . We can dene a function f : E N(U) I U as follows:

u1

u2

u3

f (e1 ) = , 0.8 , , 0.4 , , 0.7

(0.5, 0.2, 0.6) (0.7, 0.3, 0.5) (0.4, 0.5, 0.8)

u1 u2 u3

f = f (e2 ) = , 0.6 , , 0.8 , , 0.4

(0.8, 0.4, 0.5) (0.5, 0.7, 0.2) (0.7, 0.3, 0.9)

u1 u2 u3

f (e3 ) = , 0.2 , , 0.6 , , 0.5

(0.6, 0.7, 0.5) (0.5, 0.3, 0.7) (0.6, 0.5, 0.4)

u1

u2

u3

g (e1 ) = , 0.4 , , 0.7 , , 0.8

(0.6, 0.3, 0.8) (0.6, 0.5, 0.5) (0.2, 0.6, 0.4)

u1 u2 u3

g = g (e2 ) = , 0.3 , , 0.6 , , 0.8

(0.5, 0.4, 0.3) (0.4, 0.6, 0.5) (0.7, 0.2, 0.5)

g (e ) = u 1 u 2 u 3

3 , 0.8 , , 0.5 , , 0.6

(0.7, 0.5, 0.3) (0.4, 0.4, 0.6) (0.8, 0.5, 0.3)

For the purpose of storing a possibility neutrosophic soft set in a computer, we can use matrix notation of possibility neutrosophic soft

set f . For example, matrix notation of possibility neutrosophic soft set f can be written as follows: for m, n ,

(0.5, 0.2, 0.6 , 0.8) (0.7, 0.3, 0.5 , 0.4) (0.4, 0.5, 0.8 , 0.7)

f = (0.8, 0.4, 0.5 , 0.6) (0.5, 0.7, 0.2 , 0.8) (0.7, 0.3, 0.9 , 0.4)

(0.6, 0.7, 0.5 , 0.2) (0.5, 0.3, 0.7 , 0.6) (0.6, 0.5, 0.4 , 0.5)

where the m-th row vector shows f(em ) and n-th column vector shows un .

Denition 13. Let f , g PN(U, E). Then, f is said to be a possibility neutrosophic soft subset (PNS subset) of g , and denoted by f g ,

if

(2) f is a neutrosophic subset of g,

F. Karaaslan / Applied Soft Computing 54 (2017) 403414 407

Example 2. Let U = {u1 , u2 , u3 } be a set of tree houses, and let E = {e1 , e2 , e3 } be a set of parameters where e1 = modern, e2 = big and

e3 = cheap. Let f be a PNS-set dened as follows:

u1

u2

u3

f (e1 ) = , 0.8 , , 0.4 , , 0.7

(0.5, 0.2, 0.6) (0.7, 0.3, 0.5) (0.4, 0.5, 0.9)

u1 u2 u3

f = f (e2 ) = , 0.6 , , 0.8 , , 0.4

(0.8, 0.4, 0.5) (0.5, 0.7, 0.2) (0.7, 0.3, 0.9)

f (e ) = u1 u2 u3

3 , 0.2 , , 0.6 , , 0.5

(0.6, 0.7, 0.5) (0.5, 0.3, 0.8) (0.6, 0.5, 0.4)

u1

u2

u3

g (e1 ) = , 0.9 , , 0.6 , , 0.8

(0.6, 0.1, 0.5) (0.8, 0.2, 0.3) (0.7, 0.5, 0.8)

u1 u2 u3

g = g (e2 ) = , 0.7 , , 0.9 , , 0.5

(0.9, 0.2, 0.4) (0.9, 0.5, 0.1) (0.8, 0.1, 0.9)

g (e ) = u1 u2 u3

3 , 0.4 , , 0.9 , , 0.7

(0.6, 0.5, 0.4) (0.7, 0.1, 0.7) (0.8, 0.2, 0.4)

Denition 14. Let f , g PN(U, E). Then, f and g are called possibility neutrosophic soft equal set and denoted by f = g , if f g and

f g .

Denition 15. Let f PN(U, E). Then, f is said to be possibility neutrosophic soft null set, denoted by , if e E, : E N(U) I U

u

such that (e) = {( (e)(u) , (e)(u)) : u U}, where (e) = {u, 0, 1, 1 : u U} and (e) = {(u, 0) : u U}.

Denition 16. Let f PN(U, E). Then, f is said to be possibility neutrosophic soft universal set denoted by U , if e E, U : E

u

N(U) I U such that U (e) = {( U(e)(u) , (e)(u)) : u U}, where U(e) = {u, 1, 0, 0 : u U} and (e) = {(u, 1) : u U}.

(1) f

(2) f U

(3) f f

(4) f g and g h f h

Denition 17. Let f PN(U, E), where f (ek ) = {(f(ek )(uj ), (ek )(uj )) : ek E, uj U} and f (ek ) = {u, tf (ek ) (uj ), if (ek ) (uj ), ff (ek ) (uj ) } for all

ek E, u U. Then for ek E and uj U,

and

fkjt (ek ) = {(uj , tf (ek ) (uj ))}, kj (ek ) = {(uj , (ek )(uj ))}

and

fkji (ek ) = {(uj , if (ek ) (uj ))}, kj (ek ) = {(uj , (ek )(uj ))}

f

(3) f is said to be falsity-membership part of f ,

f f

f = {(fkj (ek ), kj (ek ))}

and

f

fkj (ek ) = {(uj , ff (ek ) (uj ))}, kj (ek ) = {(uj , (ek )(uj ))}

408 F. Karaaslan / Applied Soft Computing 54 (2017) 403414

f

We can write a possibility neutrosophic soft set in form f = (ft , fi , f ).

Let us consider possibility neutrosophic soft f given in Example 1. Then, possibility neutrosophic soft f can be expressed in matrix

form as follows:

(0.5, 0.8) (0.7, 0.4) (0.4, 0.7)

ft = (0.8, 0.6) (0.5, 0.8) (0.7, 0.4)

(0.6, 0.2) (0.5, 0.6) (0.6, 0.5)

(0.2, 0.8) (0.3, 0.4) (0.5, 0.7)

fi = (0.4, 0.6) (0.7, 0.8) (0.3, 0.4)

(0.7, 0.2) (0.3, 0.6) (0.5, 0.5)

(0.6, 0.8) (0.5, 0.4) (0.8, 0.7)

f = (0.5, 0.6) (0.9, 0.4)

f

(0.2, 0.8)

(0.5, 0.2) (0.7, 0.6) (0.4, 0.5)

Denition 18 ([28]). A binary operation : [0, 1] [0, 1] [0, 1] is continuous t-norm if satises the following conditions

(2) is continuous,

(3) a 1 = a, a [0, 1],

(4) a b c d whenever a c, b d and a, b, c, d [0, 1].

Denition 19 ([28]). A binary operation : [0, 1] [0, 1] [0, 1] is continuous t-conorm (s-norm) if satises the following conditions

(2) is continuous,

(3) a 0 = a, a [0, 1],

(4) a b c d whenever a c, b d and a, b, c, d [0, 1].

Denition 20. Let I3 = [0, 1] [0, 1] [0, 1] and N(I3 ) = {(a, b, c) : a, b, c [0, 1]}. Then (N(I3 ), , ) be a lattices together with partial ordered

relation , where order relation on N(I3 ) can be dened by for (a, b, c), (d, e, f) N(I3 )

(a, b, c) (e, f, g) a e, b f, c g

Smarandache [31] dened n-norm and n-conorm for non-standard unit interval ] 0, 1+ [, and referred that denitions of n-norm and

n-conorm can be adapted for normal standard real unit interval [0, 1]. Therefore, we can give denitions of n-norm and n-conorm for

normal standard real unit interval [0, 1] as follows:

is continuous n-norm if

satises the following conditions

(1)

is commutative and associative,

(2)

is continuous,

(3) a 1 = a, a [0, 1] [0, 1] [0, 1], (1 = (1, 0, 0)) and (0 = (0, 1, 1))

0 = 0, a

(4) ab

c d whenever a c, b d and a, b, c, d [0, 1] [0, 1] [0, 1].

Here, ab

= (t(a),

i(a), f (a) , t(b), i(b), f (b) ) = t(a) t(b), i(a) i(b), f (a) f (b)

is continuous n-conorm if

satises the following conditions

(1)

is commutative and associative,

(2)

is continuous,

(3) a 1 = 1, a [0, 1] [0, 1] [0, 1], (1 = (1, 0, 0)) and (0 = (0, 1, 1))

0 = a, a

(4) ab

c d whenever a c, b d and a, b, c, d [0, 1] [0, 1] [0, 1].

Here, ab

= (t(a),

i(a), f (a) , t(b), i(b), f (b) ) = t(a) t(b), i(a) i(b), f (a) f (b)

F. Karaaslan / Applied Soft Computing 54 (2017) 403414 409

Denition 23. Let f , g PN(U, E). The union of two possibility neutrosophic soft sets f and g over U, denoted by f g , is dened

by

where

uj

=

t t i i (e ), f f (e ) g f (e ))

(fkj (ek ) gkj (ek ), fkj (ek ) gkj k kj k kj k

Denition 24. Let f , g PN(U, E). The intersection of two possibility neutrosophic soft sets f and g over U, denoted by f g is

dened by

where

uj

=

f f

(fkjt (ek ) gkj

t (e ), f i (e ) g i (e ), f (e ) g (e ))

k kj k kj k kj k kj k

Example 3. Let us consider the possibility neutrosophic soft sets f and g dened as in Example 1. Let us suppose that t-norm is dened

by a b = min{a,

b} and the t-conorm is dened by a b= max{a, b} for a, b [0,

1]. Then,

u1 u2 u3

(f g )(e ) = , 0.8 , , 0.7 , , 0.8

1

(0.6, 0.2, 0.6) (0.7, 0.3, 0.5) (0.4, 0.5, 0.4)

u1 u2 u3

f g = (f g )(e2 ) = , 0.6 , , 0.8 , , 0.8

(0.8, 0.4, 0.3) (0.5, 0.6, 0.2) (0.7, 0.2, 0.5)

(f g )(e3 ) = u1 u2 u3

, 0.8 , , 0.6 , , 0.6

(0.7, 0.3, 0.3) (0.5, 0.3, 0.6) (0.8, 0.5, 0.3)

and u1

u2

u3

(f g )(e1 ) = , 0.4 , , 0.4 , , 0.7

(0.5, 0.3, 0.8) (0.6, 0.5, 0.5) (0.2, 0.6, 0.8)

u1 u2 u3

f g = (f g )(e2 ) = , 0.3 , , 0.6 , , 0.4

(0.5, 0.4, 0.5) (0.4, 0.7, 0.5) (0.7, 0.3, 0.9)

(f g )(e3 ) = u1 u2 u3

, 0.2 , , 0.5 , , 0.5

(0.6, 0.7, 0.5) (0.4, 0.5, 0.7) (0.6, 0.5, 0.4)

(1) f f = f and f f = f

(2) f g = g f and f g = g f

(3) f = and f U = f

(4) f = f and f U = U

(5) f (g h ) = (f g ) h and f (g h ) = (f g ) h

(6) f (g h ) = (f g ) (f h ) and f (g h ) = (f g ) (f h ).

Denition 25 ([18,33]). A function N : [0, 1] [0, 1] is called a negation if N(0) = 1, N(1) = 0 and N is non-increasing (x y N(x) N(y)).

A negation is called a strict negation if it is strictly decreasing (x < y N(x) > N(y)) and continuous. A strict negation is said to be a strong

negation if it is also involutive, i.e. N(N(x)) = x.

Smarandache [31] dened unary neutrosophic negation operator by interchanging truth t and falsity f vector components.

Now we dene negation and strict negation operators with similar way to Denition 25 as follows:

Denition 26. A function nN : [0, 1] [0, 1] [0, 1] [0, 1] [0, 1] [0, 1] is called a negation if nN (0) = 1, nN (1) = 0 and nN is non-

increasing (x y nN (x) nN (y)). A negation is called a strict negation if it is strictly decreasing (x y N(x) N(y)) and continuous.

Denition 27. Let f PN(U, E). Complement of possibility neutrosophic soft set f , denoted by fc , is dened by

uj

fc = e, , N(kj (ek )(uj )) : uj U :e E

nN (f (ek ))

where

f

(nN (fkj (ek )) = (N(fkjt (ek )), N(fkji (ek )), N(fkj (ek )), for all k 1 , j 2 .

410 F. Karaaslan / Applied Soft Computing 54 (2017) 403414

Example 4. Let us consider the possibility neutrosophic soft set f dene in Example 1. Suppose that the negation is dened by N(fkjt (ek )) =

f f

fkj (ek ), N(fkj (ek )) = fkjt (ek ), N(fkji (ek )) = 1 fkji (ek ) and N(kj (ek )) = 1 kj (ek ), respectively. Then, fc is dened as follow:

u1

u2

u3

f c (e ) =

1 , 0.2 , , 0.6 , , 0.3

(0.6, 0.8, 0.5) (0.5, 0.7, 0.7) (0.8, 0.5, 0.4)

u1 u2 u3

fc = fc (e2 ) = , 0.4 , , 0.2 , , 0.6

(0.5, 0.6, 0.8) (0.2, 0.3, 0.5) (0.9, 0.7, 0.7)

f c (e ) = u1 u2 u3

3 , 0.8 , , 0.4 , , 0.5

(0.5, 0.3, 0.6) (0.7, 0.7, 0.5) (0.4, 0.5, 0.6)

(1) c =U

(2) Uc =

c

(3) (fc ) = f .

c

(1) (f g ) = fc gc

c

(2) (f g ) = fc gc

Proof.

(1) Let i, j

c

c uj

(f g ) = ek , f f

, kj (ek ) kj (ek ) : uj U : ek E

(fkjt (ek ) gkj

t

(ek ), fkji (ek ) gkj

i

(ek ), fkj (ek ) gkj (ek ))

uj

= ek , f f

, N(kj (ek ) kj (ek )) : uj U : ek E

(fkj (ek ) gkj (ek ), N(fkji (ek ) gkj

i

(ek )), fkjt (ek ) gkj

t

(ek ))

uj

= ek , f f

, N(kj (ek )) N(kj (ek )) : uj U : ek E

(fkj (ek ) gkj (ek ), N(fkji (ek )) N(gkj

i

(ek ))), fkjt (ek ) gkj

t

(ek ))

uj

= ek , {( f

, N(kj (ek ))) : uj U} : ek E

(fkj (ek ), N(fkji (ek )), fkjt (ek ))

uj

ek , {( f

, N(kj (ek ))) : uj U} : ek E

i t

(gkj (ek ), N(gkj (ek )), gkj (ek ))

c

uj

= ek , {( f

, kj (ek )) : uj U} : ek E

(fkjt (ek ), N(fkji (ek )), fkj (ek ))

c

uj

ek , {( f

, kj (ek )) : uj U} : ek E = fc gc .

t i

gkj (ek ), gkj (ek ), gkj (ek )

(2) The techniques used to prove (2) are similar to those used for (1), therefore we skip the proof.

Denition 28. Let f and g PN(U, E). Then AND product of PNS-set f and g denoted by f g , is dened as follows:

f f

f g = (ek , el ), (fkjt (ek ) gljt (el ), fkji (ek ) glji (el ), fkj (ek ) glj (el )), kj (ek ) lj (el ) : (ek , el ) E E, j, k, l .

Denition 29. Let f and g PN(U, E). Then OR product of PNS-set f and g denoted by f g , is dened as follows:

f f

f g = (ek , el ), (fkjt (ek ) gljt (el ), fkji (ek ) glji (el ), fkj (ek ) glj (el )), kj (ek ) lj (el ) : (ek , el ) E E, j, k, l .

F. Karaaslan / Applied Soft Computing 54 (2017) 403414 411

In this section, we construct a decision making method over the possibility neutrosophic soft set that is called possibility neutrosophic

soft decision making method (PNS-decision making method).

f

Denition 30. Let g , h PN(U, E), f = g h , and ft , fi and f be the truth, indeterminacy and falsity matrices of -product matrix,

f

respectively. Then, weighted matrices of ft , fi

and denoted by t , i and f , are dened as follows:

f ,

t

(ekj , ur ) = t(g h )(ekj ) (ur ) + (kr (ek ) jr (ej )) t(g h )(ekj ) (ur ) (kr (ek ) jr (ej ))

i (ekj , ur ) = i(g h )(ekj ) (ur ) (kr (ek ) jr (ej ))

f (ekj , ur ) = f(g h )(ekj ) (ur ) (kr (ek ) jr (ej ))

for j, k, r .

f

Denition 31. Let g , h PN(U, E), f = g h , and let t , i and f be the weighed matrices of ft , fi and f , respectively. Then, in the

weighted matrices t , i and f scores of un U, denoted by st (un ), si (un ) and sf (un ), are dened as follows:

st (un ) = tkj (un )

k,j

si (un ) = ikj (un )

k,j

f

sf (un ) = kj (un )

k,j

where

t (ekj , un ), t (ekj , un ) = max{t (ekj , um ) : um U}

tkj (un ) =

0, otherwise

i (ekj , un ), i (ekj , un ) = max{i (ekj , um ) : um U}

ikj (un ) =

0, otherwise

f

f (ekj , un ), f (ekj , un ) = max{f (ekj , um ) : um U}

kj (un ) =

0, otherwise

Denition 32. Let st (un ), si (un ) and sf (un ) be scores of un U in the weighted matrices t , i and f . Then, decision score of un U, denoted

by ds(un ), is dened by

Algorithm.

Step 2: Construct the -product matrix,

Step 3: Construct the truth, indeterminacy and falsity matrices of the -product matrix,

Step 4: Construct the weighted matrices t , i and f ,

Step 5: Compute score of ut U, for each of the weighted matrices,

Step 6: Compute decision score, for all ut U,

Step 7: The optimal decision is to select ut = maxds(ui ).

Example 5. Assume that U = {u1 , u2 , u3 } is a set of houses and E = {e1 , e2 , e3 } = {cheap, large, moderate} is a set of parameters which is

attractiveness of houses. Suppose that Mr.X wants to buy the most suitable house.

neutrosophicsoft sets gu and h constructed

by two experts are as follows:

u1 u2

g (e ) = , 0.6 , , 0.2 ,

3

, 0.4

1

(0.5, 0.3, 0.7) (0.6, 0.2, 0.5) (0.7, 0.6, 0.5)

u1 u2 u3

g = g (e2 ) = , 0.4 , , 0.5 , , 0.6

(0.35, u0.2, 0.6) (0.7, u0.8, 0.3) (0.2, u0.4, 0.4)

g (e3 ) = 1 2 3

, 0.5 , , 0.3 , , 0.2

(0.7, 0.2, 0.5) (0.4, 0.5, 0.2) (0.5, 0.3, 0.6)

412 F. Karaaslan / Applied Soft Computing 54 (2017) 403414

u1

u2

u3

h (e1 ) = , 0.2 , , 0.5 , , 0.3

(0.3, 0.4, 0.5) (0.7, 0.3, 0.4) (0.4, 0.5, 0.2)

u1 u2 u3

h = h (e2 ) = , 0.3 , , 0.7 , , 0.8

(0.4, 0.6, 0.2) (0.2, 0.5, 0.3) (0.4, 0.6, 0.2)

h (e3 ) = u 1 u 2 u 3

, 0.7 , , 0.4 , , 0.4

(0.2, 0.1, 0.6) (0.8, 0.4, 0.5) (0.6, 0.4, 0.3)

Step 2: Let us consider possibility neutrosophic soft set -product f = g h which is the mapping : E E N(U) I U given as follows:

f

Step 3: We construct matrices ft , fi and f as follows:

F. Karaaslan / Applied Soft Computing 54 (2017) 403414 413

ds(u1 ) = 1, 18 0, 18 1, 32 = 0, 32

ds(u2 ) = 2, 89 1, 42 0, 32 = 0, 90

ds(u3 ) = 2, 68 0, 66 0, 57 = 1, 45

5. Conclusion

In this paper, we introduced the concept of possibility neutrosophic soft set and possibility neutrosophic soft set operations, and

studied some properties related with operations dened. Also, we presented a decision making method based on possibility neutrosophic

soft set, and gave an application of this method to solve a decision making problem. The proposed method may be used in many different

applications to solve the related problems. In future, researchers may study on set theoretical operations of possibility neutrosophic soft

sets and integrate decision making methods to the TOPSIS, ELECTRE and other some decision making methods.

414 F. Karaaslan / Applied Soft Computing 54 (2017) 403414

Acknowledgements

The author would like to thank the anonymous referees for their constructive comments as well as helpful suggestions from the Editor-

in-Chief which helped in improving this paper signicantly. The author is also grateful to Associate Professor Naim Cagman for his help to

improve the linguistic quality of this paper.

References

[1] M.I. Ali, F. Feng, X. Liu, W.K. Min, On some new operations in soft set theory, Comput. Math. Appl. 57 (9) (2009) 15471553.

[2] M. Agarwal, K.K. Biswas, M. Hanmandlu, Generalized intuitionistic fuzzy soft sets with applications in decision-making, Appl. Soft Comput. 13 (8) (2013) 35523566.

[3] K. Atanassov, Intuitionistic fuzzy sets, Fuzzy Set Syst. 20 (1986) 8796.

[4] S. Alkhazaleh, A.R. Salleh, N. Hassan, Possibility fuzzy soft set, Adv. Decis. Sci. (2011), http://dx.doi.org/10.1155/2011/479756.

[5] K. Atanassov, Intuitionistic fuzzy sets, Fuzzy Set Syst. 20 (1986) 8796.

[6] M. Bashir, A.R. Salleh, S. Alkhazaleh, Possibility intuitionistic fuzzy soft set, Adv. Decis. Sci. (2012), http://dx.doi.org/10.1155/2012/404325.

[7] S. Broumi, Generalized neutrosophic soft set, Int. J. Comput. Sci. Eng. Inf. Technol. 3 (2) (2013) 1730.

[8] S. Broumi, I. Deli, F. Smarandache, Neutrosophic parametrized soft set theory and its decision making, Int. Front. Sci. Lett. 1 (1) (2014) 111.

[9] N. Cagman, S. Enginoglu, Soft set theory and uni-int decision making, Eur. J. Oper. Res. 207 (2010) 848855.

[10] N. Cagman, F. Ctak, S. Enginoglu, FP-soft set theory and its applications, Ann. Fuzzy Math. Inf. 2 (2) (2011) 219226.

[11] N. Cagman, S. Karatas, Intuitionistic fuzzy soft set theory and its decision making, J. Intell. Fuzzy Syst. 24 (4) (2013) 829836.

[12] N. Cagman, Contributions to the theory of soft sets, J. New Results Sci. 4 (2014) 3341.

[13] S. Das, S. Kar, Group decision making in medical system: an intuitionistic fuzzy soft set approach, Appl. Soft Comput. 24 (2014) 196211.

[14] I. Deli, Interval-valued neutrosophic soft sets ant its decision making, Int. J. Mach. Learn. Cybern. (2015), http://dx.doi.org/10.1007/s13042-015-0461-3.

[15] I. Deli, S. Broumi, Neutrosophic soft matrices and NSM-decision making, J. Intell. Fuzzy Syst. 28 (5) (2015) 22332241.

[16] I. Deli, N. Cagman, Intuitionistic fuzzy parameterized soft set theory and its decision making, Appl. Soft Comput. 28 (2015) 109113.

[17] F. Feng, Y.M. Li, N. Cagman, Generalized uni-int decision making schemes based on choice value soft sets, Eur. J. Oper. Res. 220 (2012) 162170.

[18] J. Fodor, M. Roubens, Fuzzy Preference Modelling and Multicriteria Decision Support, Kluwer, 1994.

[19] W.L. Gau, D.J. Buehrer, Vague sets, IEEE Trans. Syst. Man Cybern. 23 (2) (1993) 610614.

[20] F. Karaaslan, Neutrosophic soft sets with applications in decision making, Int. J. Inf. Sci. Intell. Syst. 4 (2) (2015) 120.

[21] D. Molodtsov, Soft set theory rst results, Comput. Math. Appl. 37 (1999) 1931.

[22] P.K. Maji, R. Biswas, A.R. Roy, Intuitionistic fuzzy soft sets, J. Fuzzy Math. 9 (3) (2001) 677692.

[23] P.K. Maji, A.R. Roy, R. Biswas, An application of soft sets in a decision making problem, Comput. Math. Appl. 44 (2002) 10771083.

[24] P.K. Maji, R. Biswas, A.R. Roy, Soft set theory, Comput. Math. Appl. 45 (2003) 555562.

[25] P.K. Maji, Neutrosophic soft set, Ann. Fuzzy Math. Inf. 5 (1) (2013) 157168.

[26] Z. Pawlak, Rough sets, Int. J. Inf. Comput. Sci. 11 (1982) 341356.

[27] K. Qin, J. Yang, X. Zhang, Soft Set Approaches to Decision Making Problems. Rough Sets and Knowledge Technology, in: Lecture Notes in Computer Science 7414, 2012,

pp. 456464.

[28] B. Schweirer, A. Sklar, Statistical metric space, Pac. J. Math. 10 (1960) 314334.

[29] R. Sahin, A. Kck, Generalized neutrosophic soft set and its integration to decision making problem, Appl. Math. Inf. Sci. 8 (6) (2014) 19.

[30] A. Sezgin, A.O. Atagn, On operations of soft sets, Comput. Math. Appl. 61 (2011) 14571467.

[31] F. Smarandache, An Unifying Field in Logics: Neutrosophic Logic, Neutrosophy, Neutrosophic Set, Neutrosophic Probability and Statistics, American Research Press,

Rehoboth, 2005.

[32] F. Smarandache, Neutrosophic set a generalization of the intuitionistic fuzzy set, Int. J. Pure Appl. Math. 24 (3) (2005) 287297.

[33] E. Trillas, Sobre funciones de negacion en la teoria de conjuntos difusos, Stochastica 3 (1979) 4760.

[34] L.A. Zadeh, Fuzzy sets, Inf. Control 8 (1965) 338353.

[35] K. Zhi, W. Lifu, W. Zhaoxia, Q. Shiqing, W. Haifang, An efcient decision making approach in incomplete soft set, Appl. Math. Model. 38 (78) (2014) 21412150.

[36] P. Zhu, Q. Wen, Operations on soft sets revisited, J. Appl. Math. (2013), http://dx.doi.org/10.1155/2013/105752.

- Logic & ProofsUploaded byShashank Sabhlok
- ptc1Uploaded bynaidoori
- about Fuzzy logic-0Uploaded byapi-19667371
- Pso PosterUploaded byGeorge Iskander
- Fuzzy GaUploaded byc_mc2
- Thesis HeaderflpssUploaded byDeb Swarup
- c 0186011312Uploaded byAriska Hengky
- Critical Paths Identification on Fuzzy Network ProjectUploaded byInternational Organization of Scientific Research (IOSR)
- 02626660109492832Uploaded bySudharsananPRS
- FuzzyUploaded bySudharsananPRS
- Multi Objective Transportation Model With FuzzyUploaded bysaraasadi
- FLTUploaded byMallox
- week 9 maths avivaUploaded byapi-229083938
- Implementing of Multi Fuzzy Controllers for Multi Sensors to Steer Wheeled Mobile Robot 3rd ICMSAO JUploaded bySutha Sangapillai
- ThermodynamicsUploaded byabhishek
- 836Uploaded byTangkas Sabililla
- Handouts on Data-driven Modelling, part 3 (UNESCO-IHE)Uploaded bysolomatine
- A Survey Of Fuzzy Control For Stabilized PlatformsUploaded byijcses
- Place of possibility theory in transportation analysis.pdfUploaded bysidxxxnitc
- Fuzzy random variables and Kolomogrov’s important resultsUploaded byinventionjournals
- Application of Branch and Bound Technique for 3 Stage Flow Shop Scheduling Problem With Transportation TimeUploaded byAlexander Decker
- Trajectory Data Fuzzy Modeling : Ambulances Management Use CaseUploaded byMaurice Lee
- fuzzy logicUploaded byNandha Kishore
- A_STUDY_OF_DM_TECHNIQUES_IN_SOFT_COMPUTI.pdfUploaded byKarthi BE
- ch06Uploaded byspock126
- grhtrjhUploaded byCici Jusnia
- Unit 04Uploaded bygaurav775588
- A Hybrid Approach for Design of Stable AdaptiveUploaded bysankarsada
- Session Plan Information and Communication Technology (Ict)Uploaded byEdryl Piamonte Ugpo
- DiscreteUploaded byirwan

- On Neutrosophic Crisp Semi Alpha Closed SetsUploaded byMia Amalia
- Single Valued Neutrosophic Numbers and Analytic Hierarchy Process for Project SelectionUploaded byMia Amalia
- Neutrosophic Triplet Normed Ring SpaceUploaded byMia Amalia
- Rough Neutrosophic Multisets Relation with Application in Marketing StrategyUploaded byMia Amalia
- Different Forms of Triangular Neutrosophic Numbers, De-Neutrosophication Techniques, and their ApplicationsUploaded byMia Amalia
- An OWA Distance-Based, Single-Valued Neutrosophic Linguistic TOPSIS Approach for Green Supplier Evaluation and Selection in Low-Carbon Supply ChainsUploaded byMia Amalia
- Neutrosophic Units of Neutrosophic Rings and FieldsUploaded byMia Amalia
- Multi-Objective Portfolio Selection Model with Diversification by Neutrosophic Optimization TechniqueUploaded byMia Amalia
- Neutrosophic Crisp Bi-Topological SpacesUploaded byMia Amalia
- Bi-level Linear Programming Problem with Neutrosophic NumbersUploaded byMia Amalia
- An Inventory Model under Space Constraint in Neutrosophic Environment: A Neutrosophic Geometric Programming ApproachUploaded byMia Amalia
- A Revisit to NC-VIKOR Based MAGDM Strategy in Neutrosophic Cubic Set EnvironmentUploaded byMia Amalia
- Fuzzy Neutrosophic Alpha m-Closed Sets in Fuzzy NeutrosophicTopological SpacesUploaded byMia Amalia
- Smarandache Curves According to q-Frame in Euclidean 3-SpaceUploaded byMia Amalia
- On Smarandache Curves of Involute-evolute Curve According to Frenet Frame in Minkowski 3-spaceUploaded byMia Amalia
- On Geodesics of the Tangent and Normal Surfaces Defined by TN-Smarandache Curve According to Frenet FrameUploaded byMia Amalia
- A Generalization of Surfaces Family with Common Smarandache Asymptotic Curves in Galilean SpaceUploaded byMia Amalia
- Smarandache Curves of Bertrand Curves Pair According to Frenet FrameUploaded byMia Amalia
- A Neutrosophic Set Based Fault Diagnosis Method Based on Multi-Stage Fault Template DataUploaded byMia Amalia
- Fundamental Homomorphism Theorems for Neutrosophic Extended Triplet GroupsUploaded byMia Amalia
- A Forecasting Model Based on Multi-Valued Neutrosophic Sets and Two-Factor, Third-Order Fuzzy Fluctuation Logical RelationshipsUploaded byMia Amalia
- Fixed Point Theorem for Neutrosophic Triplet Partial Metric SpaceUploaded byMia Amalia
- SINGLE-VALUED NEUTROSOPHIC HYPERGRAPHSUploaded byMia Amalia
- Research on Construction Engineering Project Risk Assessment with Some 2-Tuple Linguistic Neutrosophic Hamy Mean OperatorsUploaded byMia Amalia
- Some Generalized Dice Measures for Double-Valued Neutrosophic Sets and Their ApplicationsUploaded byMia Amalia
- Some Generalized Dice Measures for Double-Valued Neutrosophic Sets and Their ApplicationsUploaded byMia Amalia
- Dual Generalized Nonnegative Normal Neutrosophic Bonferroni Mean Operators and Their Application in Multiple Attribute Decision MakingUploaded byMia Amalia
- Different Methodologies in Treating UncertaintyUploaded byMia Amalia
- Design of Fuzzy Cognitive Model of Mutual Influence and Connectivity of Innovative TechnologiesUploaded byMia Amalia
- The Location Selection for Roundabout Construction Using Rough BWM-Rough WASPAS Approach Based on a New Rough Hamy AggregatorUploaded byMia Amalia

- 1_stage_manual BORNIKOV.pdfUploaded bymiljenko123
- Chapter 13 Interacting Cracks Analysis Using Finite Element MethodUploaded byJorge Perdigon
- Easy Mathematics for Biologists-FosterUploaded bybookreader1968
- In-Plant Training Presentation_11OIL1014Uploaded byNikhil Chipade
- Induct Rack Magnetic LevitationUploaded byHashim Munir
- Fundamentals of Continuum Mechanics With Applications to Mechanical Thermomechanical and Smart MaterialsUploaded byManoj Singh
- ShotPut_KaiMillar9DUploaded bykai2coolio
- Gea 19377 Masoneilan 35002 Camflex Valve BrochureUploaded byCatalina Ramirez
- quantsUploaded byAnatoli Krasilnikov
- tidu248.pdfUploaded byNguyễn Duy Thức
- TribologiUploaded byRahmat Novianto
- MEMSUploaded byablaska
- report 4Uploaded byMaria Anh Thư
- Measuring Inaccesible Points in Land SurveyingUploaded byCristi Istrate
- VLSI designUploaded byqwertyuiop
- CAT-4162-5-UK_Parflange.pdfUploaded bykko
- Energy Optimisation Software for Drinking WaterT\ESTUploaded byDalibor-Jelena Vlaški
- catalogo de boyles bros.pdfUploaded byEDSON
- FRP Net LiteraturUploaded byvijay10484
- TSL1402R_DS000147_2-00-559278Uploaded byLakmal Gayan
- Aeroelasticity - Aileron Reversal 3DUploaded byZamri Nasir
- Rt EllipseUploaded byShell Boy
- 20151201_medhistory_milestones_history_of_ct_at_siemens_english.pdfUploaded bynew2track
- DNV 2 7 3 2006.pdfUploaded byFathiah Olpah Siara
- Spec 315 MV 105 PowerGuard-XL 35KV (2)Uploaded bySarah Pink
- DenemUploaded byAhmet Dilova
- E-110 Feed Overhead ExchangerUploaded byTahir Mahmood
- Touch ScreenUploaded bySoumyabrata
- GEOLOGYUploaded bylea becerro
- Information Theory and Coding (J.G. Daugman)Uploaded byLandini Carlo Alessandro

## Much more than documents.

Discover everything Scribd has to offer, including books and audiobooks from major publishers.

Cancel anytime.