-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathwolgenengine.cpp
161 lines (141 loc) · 4.51 KB
/
wolgenengine.cpp
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
/*
* wolgenengine.cpp
*
* Created on: Oct 22, 2014
* Author: user
*/
#include <cassert>
#include "wolimplengine.h"
#include "wolexp.h"
#include "wolvalue.h"
#include "wolgenengine.h"
#include "wolevalfactory.h"
#include "wolmgr.h"
namespace wolver {
/*
* for op in node->parents
* E_op = Fwd_Impl(value, R_c) /\ R_op
* Ec = Back_Impl(E_op, value) /\ R_c
* U1 = Back_Impl(R_op - E_op, Rc)
* U2 = Back_Impl(E_op, R_c - E_c)
* U_op = U1 \/ U2
* U_total = U_total \/ U_op
*
* gen_value = R_node - U_total
* assert(value in gen_value)
*
*/
WolValueSptr
WolSimpleGenEngine::performGenerlization(WolNodeSptr node, WolValueSptr value) {
WolEvalFactory *evalFactory = WolMgr::getInstance().getEvalFactory();
auto parents = node->getParents();
//FIX ME:
return value;
WolValueSptr U_total = nullptr;
for (auto i : parents) {
auto parent = dynamic_pointer_cast<WolComplexNode>(i.lock());
assert(parent);
auto R_op = parent->getValue();
if (parent->getArity() == 2) {
auto children = parent->getChildren();
auto fNode = (children[0] == node) ? children[1] : children[0];
auto R_c = fNode->getValue();
auto E_op = evalFactory->evalIntersection(
parent->performForwardImplication(value, R_c),
R_op);
auto E_c = evalFactory->evalIntersection(
fNode->performBackwardImplication(parent, E_op, value),
R_c);
auto U1 = node->performBackwardImplication(
parent,
evalFactory->evalDiff(R_op, E_op),
R_c);
auto U2 = node->performBackwardImplication(
parent,
E_op,
evalFactory->evalDiff(R_c , E_c));
auto U_op = evalFactory->evalUnion(U1, U2);
U_total = evalFactory->evalUnion(U_total, U_op);
}
else if (parent->getArity() == 3) {
auto children = parent->getChildren();
WolNodeSptr fNode1 = nullptr;
WolNodeSptr fNode2 = nullptr;
WolValueSptr E_op = nullptr;
WolValueSptr R_c1 = nullptr;
WolValueSptr R_c2 = nullptr;
WolValueSptr E_c1 = nullptr;
WolValueSptr E_c2 = nullptr;
if (children[0] == node) {
fNode1 = children[1];
fNode2 = children[2];
R_c1 = children[1]->getValue();
R_c2 = children[2]->getValue();
E_op = evalFactory->evalIntersection(
parent->performForwardImplication(value, R_c1, R_c2),
R_op);
E_c1 = evalFactory->evalIntersection(
fNode1->performBackwardImplication(parent, E_op, value, R_c2),
R_c1);
E_c2 = evalFactory->evalIntersection(
fNode2->performBackwardImplication(parent, E_op, value, R_c1),
R_c2);
}
else if (children[1] == node) {
fNode1 = children[0];
fNode2 = children[2];
R_c1 = children[0]->getValue();
R_c2 = children[2]->getValue();
E_op = evalFactory->evalIntersection(
parent->performForwardImplication(R_c1, value, R_c2),
R_op);
E_c1 = evalFactory->evalIntersection(
fNode1->performBackwardImplication(parent, E_op, value, R_c2),
R_c1);
E_c2 = evalFactory->evalIntersection(
fNode2->performBackwardImplication(parent, E_op, R_c1, value),
R_c2);
}
else {
assert(children[2] == node);
fNode1 = children[0];
fNode2 = children[1];
R_c1 = children[0]->getValue();
R_c2 = children[1]->getValue();
E_op = evalFactory->evalIntersection(
parent->performForwardImplication(R_c1, R_c2, value),
R_op);
E_c1 = evalFactory->evalIntersection(
fNode1->performBackwardImplication(parent, E_op, R_c2, value),
R_c1);
E_c2 = evalFactory->evalIntersection(
fNode2->performBackwardImplication(parent, E_op, R_c1, value),
R_c2);
}
auto U1 = node->performBackwardImplication(
parent,
evalFactory->evalDiff(R_op, E_op),
R_c1, R_c2);
auto U2 = node->performBackwardImplication(
parent,
E_op,
evalFactory->evalDiff(R_c1, E_c1),
evalFactory->evalDiff(R_c2, E_c2));
auto U_op = evalFactory->evalUnion(U1, U2);
U_total = evalFactory->evalUnion(U_total, U_op);
}
else {
assert(parent->getArity() == 1);
auto E_op = evalFactory->evalIntersection(
parent->performForwardImplication(value),
R_op);
auto U_op = node->performBackwardImplication(
parent,
evalFactory->evalDiff(R_op, E_op));
U_total = evalFactory->evalUnion(U_total, U_op);
}
}
auto gen_value = evalFactory->evalDiff(node->getValue(), U_total);
return gen_value;
}
}