-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.py
171 lines (140 loc) · 5.94 KB
/
main.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
from __future__ import annotations
from functools import reduce
from typing import Type
class InvalidMembershipException(Exception):
pass
class FuzzySet():
values: set[tuple[str, float]]
name: str
domain: str
def __init__(self, name, values:set[tuple[str, float]]|None=None, domain: str = 'U'):
if values is None:
values = set()
self.name = name
for (value, membership) in values:
if (membership < 0 or membership > 1) or (not isinstance(value, (str, tuple))):
raise InvalidMembershipException(f"{value} Membership must be in [0, 1]")
self.values = values
self.domain = domain
def get_membership(self, value: str):
for (val, membership) in self.values:
if val == value:
return membership
return 0
def __iter__(self):
return iter(self.values)
def __str__(self):
return f"{self.name}: {self.values}"
def __repr__(self):
return str(self)
def __eq__(self, other: FuzzySet):
return self.name == other.name and reduce(lambda x, y: x and y, map(lambda x: x in other.values, self.values), True)
def __hash__(self):
return hash(self.name)
def __contains__(self, value: tuple[str, float]):
return self.get_membership(value[0]) != 0
def __len__(self):
return len(self.values)
def compliment(self):
return FuzzySet(f"~{self.name}", set(map(lambda x: (x[0], 1 - x[1]), self.values)))
def intersection(self, other: FuzzySet):
new_values = set()
for (value, membership) in self.values:
if other.get_membership(value) != 0:
new_values.add((value, min(membership, other.get_membership(value))))
return FuzzySet(f"{self.name} ∩ {other.name}", new_values)
def union(self, other: FuzzySet):
new_values = set()
for (value, membership) in self.values:
new_values.add((value, max(membership, other.get_membership(value))))
for (value, membership) in other.values:
if self.get_membership(value) == 0:
new_values.add((value, membership))
return FuzzySet(f"{self.name} U {other.name}", new_values)
def __mul__(self, other: FuzzySet | int | float):
if isinstance(other, FuzzySet):
if self.domain != other.domain:
return self.cartesian_product(other)
else:
new_values = set()
for (value, membership) in self.values:
if (value, membership) in other:
new_values.add((value, membership * other.get_membership(value)))
return FuzzySet(f"{self.name} x {other.name}", new_values)
elif isinstance(other, (int, float)):
return self.crisp_product(other)
def crisp_product(self, d: float | int):
new_values = set()
for (value, membership) in self.values:
new_values.add((value, membership * d))
return FuzzySet(f"{self.name} x {d}", new_values)
def __pow__(self, d: float | int):
new_values = set()
for (value, membership) in self.values:
new_values.add((value, membership ** d))
return FuzzySet(f"{self.name}^{d}", new_values)
def power(self, d: float | int):
return self.__pow__(d)
def __add__(self, other: FuzzySet):
new_values = set()
for (value, membership) in self.values:
_m = membership + other.get_membership(value) - (membership * other.get_membership(value))
new_values.add((value, _m))
for (value, membership) in other.values:
if self.get_membership(value) == 0:
new_values.add((value, membership))
return FuzzySet(f"{self.name} + {other.name}", new_values)
def add(self, other: tuple[str, float]):
self.values.add(other)
def bounded_sum(self, other):
new_values = set()
for (value, membership) in self.values:
if (value, membership) in other:
_m = min(1, membership + other.get_membership(value))
new_values.add((value, _m))
else:
new_values.add((value, membership))
return FuzzySet(f"{self.name} ⊕ {other.name}", new_values)
def __sub__(self, other: FuzzySet):
new_values = set()
for (value, membership) in self.values:
if (value, membership) in other:
new_values.add((value, min(membership, 1 - other.get_membership(value))))
else:
new_values.add((value, membership))
return FuzzySet(f"{self.name} - {other.name}", new_values)
def sub(self, other: FuzzySet):
return self.__sub__(other)
def bounded_sub(self, other: FuzzySet):
new_values = set()
for (value, membership) in self.values:
if (value, membership) in other:
_m = max(0, membership + other.get_membership(value) - 1)
new_values.add((value, _m))
else:
new_values.add((value, membership))
return FuzzySet(f"{self.name} ⊖ {other.name}", new_values)
def cartesian_product(self, other: FuzzySet):
new_values = set()
for (value, membership) in self.values:
for (value2, membership2) in other:
new_values.add(((value, value2), min(membership, membership2)))
return FuzzySet(f"{self.name} xᶜ {other.name}", new_values)
def main():
A = FuzzySet("A", {("P", 0.9), ("Q", 0.1)})
B = FuzzySet("B", {("P", 0.8), ("Q", 0.2)})
C = FuzzySet("C", {("S", 0.7), ("T", 0.3)}, "V")
print(A.intersection(B))
print(A.union(B))
print(A.compliment())
print(A * B)
print(A + B)
print(A - B)
# Cartesian product
X = A * C
Y = C * A
print(X)
print(Y)
print(X == Y)
if __name__ == "__main__":
main()