Debian Codegraph @

Source/Reasoner/Classifier/COptimizedKPSetRoleTestingItem.cpp

raw
1 /*
2 * Copyright (C) 2013-2015, 2019 by the Konclude Developer Team.
3 *
4 * This file is part of the reasoning system Konclude.
5 * For details and support, see <http://konclude.com/>.
6 *
7 * Konclude is free software: you can redistribute it and/or modify
8 * it under the terms of version 3 of the GNU Lesser General Public
9 * License (LGPLv3) as published by the Free Software Foundation.
10 *
11 * Konclude is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU (Lesser) General Public License for more details.
15 *
16 * You should have received a copy of the GNU (Lesser) General Public
17 * License along with Konclude. If not, see <http://www.gnu.org/licenses/>.
18 *
19 */
20
21 #include "COptimizedKPSetRoleTestingItem.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Classifier {
29
30
31 COptimizedKPSetRoleTestingItem::COptimizedKPSetRoleTestingItem() {
32 }
33
34
35 COptimizedKPSetRoleTestingItem* COptimizedKPSetRoleTestingItem::initSatisfiableTestingItem(CRole* role) {
36 mRole = role;
37 mConSatHierNode = nullptr;
38 mPredCounter = 0;
39 mSatTestedResult = false;
40 mSatTestOrdered = false;
41 mTestedSat = false;
42 mUnsatDerivated = false;
43 mSatDerivated = false;
44 mEquiItem = false;
45 mPredOfItem = false;
46
47 mPossibleSubsumptionMap = nullptr;
48 mPossSubsumMapInitialized = false;
49 mPropagationConnected = false;
50
51 mPossibleSubsumedList = nullptr;
52 mPossibleSubsumedSet = nullptr;
53
54 mTmpMarkerConcept = nullptr;
55 mTmpPropagationConcept = nullptr;
56 mTmpExistConcept = nullptr;
57
58 return this;
59 }
60
61 COptimizedKPSetRoleTestingItem::~COptimizedKPSetRoleTestingItem() {
62 delete mPossibleSubsumedList;
63 delete mPossibleSubsumedSet;
64 }
65
66
67
68 CConcept* COptimizedKPSetRoleTestingItem::getTemporaryMarkerConcept() {
69 return mTmpMarkerConcept;
70 }
71
72 CConcept* COptimizedKPSetRoleTestingItem::getTemporaryPropagationConcept() {
73 return mTmpPropagationConcept;
74 }
75
76 CConcept* COptimizedKPSetRoleTestingItem::getTemporaryExistConcept() {
77 return mTmpExistConcept;
78 }
79
80 COptimizedKPSetRoleTestingItem* COptimizedKPSetRoleTestingItem::setTemporaryMarkerConcept(CConcept* markerConcept) {
81 mTmpMarkerConcept = markerConcept;
82 return this;
83 }
84
85 COptimizedKPSetRoleTestingItem* COptimizedKPSetRoleTestingItem::setTemporaryPropagationConcept(CConcept* propConcept) {
86 mTmpPropagationConcept = propConcept;
87 return this;
88 }
89
90 COptimizedKPSetRoleTestingItem* COptimizedKPSetRoleTestingItem::setTemporaryExistConcept(CConcept* existConcept) {
91 mTmpExistConcept = existConcept;
92 return this;
93 }
94
95
96
97 CRole* COptimizedKPSetRoleTestingItem::getTestingRole() {
98 return mRole;
99 }
100
101
102 CRolePropertiesHierarchyNode* COptimizedKPSetRoleTestingItem::getSatisfiableRoleHierarchyNode() {
103 return mConSatHierNode;
104 }
105
106
107 COptimizedKPSetRoleTestingItem* COptimizedKPSetRoleTestingItem::setSatisfiableRoleHierarchyNode(CRolePropertiesHierarchyNode* hierNode) {
108 mConSatHierNode = hierNode;
109 return this;
110 }
111
112
113 QSet<COptimizedKPSetRoleTestingItem*>* COptimizedKPSetRoleTestingItem::getSubsumerRoleItemSet() {
114 return &mSubsumingConceptItemSet;
115 }
116
117 QList<COptimizedKPSetRoleTestingItem*>* COptimizedKPSetRoleTestingItem::getSubsumerRoleItemList() {
118 return &mSubsumingConceptItemList;
119 }
120
121
122 cint64 COptimizedKPSetRoleTestingItem::getSubsumerRoleItemCount() const {
123 return mSubsumingConceptItemSet.count();
124 }
125
126 bool COptimizedKPSetRoleTestingItem::hasSubsumerRoleItem(COptimizedKPSetRoleTestingItem* item) {
127 return mSubsumingConceptItemSet.contains(item);
128 }
129
130
131 QList<COptimizedKPSetRoleTestingItem*>* COptimizedKPSetRoleTestingItem::getSuccessorItemList() {
132 return &mSuccList;
133 }
134
135 cint64 COptimizedKPSetRoleTestingItem::getUnprocessedPredecessorItemCount() {
136 return mPredCounter;
137 }
138
139 bool COptimizedKPSetRoleTestingItem::hasOnlyProcessedPredecessorItems() {
140 return mPredCounter <= 0;
141 }
142
143 COptimizedKPSetRoleTestingItem* COptimizedKPSetRoleTestingItem::decUnprocessedPredecessorItems(cint64 decCount) {
144 mPredCounter -= decCount;
145 return this;
146 }
147
148 COptimizedKPSetRoleTestingItem* COptimizedKPSetRoleTestingItem::incUnprocessedPredecessorItems(cint64 incCount) {
149 mPredCounter += incCount;
150 return this;
151 }
152
153 COptimizedKPSetRoleTestingItem* COptimizedKPSetRoleTestingItem::setUnprocessedPredecessorItems(cint64 predCount) {
154 mPredCounter = predCount;
155 return this;
156 }
157
158
159 COptimizedKPSetRoleTestingItem* COptimizedKPSetRoleTestingItem::addSuccessorSatisfiableTestItem(COptimizedKPSetRoleTestingItem* succItem) {
160 mSuccList.append(succItem);
161 return this;
162 }
163
164
165 bool COptimizedKPSetRoleTestingItem::isSatisfiableTestOrdered() {
166 return mSatTestOrdered;
167 }
168
169 bool COptimizedKPSetRoleTestingItem::isSatisfiableTested() {
170 return mTestedSat;
171 }
172
173 bool COptimizedKPSetRoleTestingItem::isResultUnsatisfiableDerivated() {
174 return mUnsatDerivated;
175 }
176
177 bool COptimizedKPSetRoleTestingItem::isResultSatisfiableDerivated() {
178 return mSatDerivated;
179 }
180
181 bool COptimizedKPSetRoleTestingItem::getSatisfiableTestedResult() {
182 return mSatTestedResult;
183 }
184
185 COptimizedKPSetRoleTestingItem* COptimizedKPSetRoleTestingItem::setSatisfiableTestOrdered(bool satTestOrdered) {
186 mSatTestOrdered = satTestOrdered;
187 return this;
188 }
189
190 COptimizedKPSetRoleTestingItem* COptimizedKPSetRoleTestingItem::setSatisfiableTested(bool satTested) {
191 mTestedSat = satTested;
192 return this;
193 }
194
195 COptimizedKPSetRoleTestingItem* COptimizedKPSetRoleTestingItem::setSatisfiableTestedResult(bool satTestedResult) {
196 mSatTestedResult = satTestedResult;
197 return this;
198 }
199
200 COptimizedKPSetRoleTestingItem* COptimizedKPSetRoleTestingItem::setResultUnsatisfiableDerivated(bool unsatDerivated) {
201 mUnsatDerivated = unsatDerivated;
202 return this;
203 }
204
205 COptimizedKPSetRoleTestingItem* COptimizedKPSetRoleTestingItem::setResultSatisfiableDerivated(bool satDerivated) {
206 mSatDerivated = satDerivated;
207 return this;
208 }
209
210
211 COptimizedKPSetRoleTestingItem* COptimizedKPSetRoleTestingItem::addSubsumerRoleItem(COptimizedKPSetRoleTestingItem* subsumingItem) {
212 if (!mSubsumingConceptItemSet.contains(subsumingItem)) {
213 mSubsumingConceptItemList.append(subsumingItem);
214 mSubsumingConceptItemSet.insert(subsumingItem);
215
216 //QString iriClassNameString = CIRIName::getRecentIRIName(subsumingItem->getTestingConcept()->getClassNameLinker());
217 //mSubsumingConceptString += QString("%1\r\n").arg(iriClassNameString);
218 }
219 return this;
220 }
221
222
223
224 CConceptSubsumerObserver* COptimizedKPSetRoleTestingItem::tellConceptSupsumption(CConcept* subsumedConcept, CConcept* subsumerConcept) {
225 if (subsumerConcept->getOperatorCode() != CCTOP) {
226 CConceptProcessData* conProData = (CConceptProcessData*)subsumerConcept->getConceptData();
227 CConceptSatisfiableReferenceLinkingData* conSatRefLinking = (CConceptSatisfiableReferenceLinkingData*)conProData->getConceptReferenceLinking();
228 if (conSatRefLinking) {
229 COptimizedKPSetRoleTestingItem* subsumerClassSaturationItem = (COptimizedKPSetRoleTestingItem*)conSatRefLinking->getClassifierReferenceLinkingData();
230 addSubsumerRoleItem(subsumerClassSaturationItem);
231 }
232 }
233 return this;
234 }
235
236
237 bool itemSortLessThan(const COptimizedKPSetRoleTestingItem* item1, const COptimizedKPSetRoleTestingItem* item2) {
238 return item1->getSubsumerRoleItemCount() > item2->getSubsumerRoleItemCount();
239 }
240
241 QList<COptimizedKPSetRoleTestingItem*>* COptimizedKPSetRoleTestingItem::sortSubsumingConceptItemList() {
242 qSort(mSubsumingConceptItemList.begin(),mSubsumingConceptItemList.end(),itemSortLessThan);
243 return &mSubsumingConceptItemList;
244 }
245
246 bool COptimizedKPSetRoleTestingItem::isEquivalentItem() {
247 return mEquiItem;
248 }
249
250 COptimizedKPSetRoleTestingItem* COptimizedKPSetRoleTestingItem::setEquivalentItem(bool equivalent) {
251 mEquiItem = equivalent;
252 return this;
253 }
254
255
256 bool COptimizedKPSetRoleTestingItem::isPredecessorItem() {
257 return mPredOfItem;
258 }
259
260 COptimizedKPSetRoleTestingItem* COptimizedKPSetRoleTestingItem::setPredecessorItem(bool isPredecessorOfOneItem) {
261 mPredOfItem = isPredecessorOfOneItem;
262 return this;
263 }
264
265 bool COptimizedKPSetRoleTestingItem::isMoreConceptClassificationInformationRequired() {
266 if (mSatTestOrdered || mTestedSat || mUnsatDerivated || mSatDerivated) {
267 return false;
268 }
269 return true;
270 }
271
272 COptimizedKPSetRolePossibleSubsumptionMap* COptimizedKPSetRoleTestingItem::getPossibleSubsumptionMap(bool create) {
273 if (!mPossibleSubsumptionMap && create) {
274 mPossibleSubsumptionMap = new COptimizedKPSetRolePossibleSubsumptionMap();
275 }
276 return mPossibleSubsumptionMap;
277 }
278
279
280 CPropertyPossibleSubsumptionMap* COptimizedKPSetRoleTestingItem::getPropertyPossibleSubsumptionMap() {
281 return getPossibleSubsumptionMap(false);
282 }
283
284
285 QSet<COptimizedKPSetRoleTestingItem*>* COptimizedKPSetRoleTestingItem::getUpPropagationItemSet() {
286 return &mUpPropagationItemSet;
287 }
288
289 QSet<COptimizedKPSetRoleTestingItem*>* COptimizedKPSetRoleTestingItem::getDownPropagationItemSet() {
290 return &mDownPropagationItemSet;
291 }
292
293 COptimizedKPSetRoleTestingItem* COptimizedKPSetRoleTestingItem::addUpPropagationItem(COptimizedKPSetRoleTestingItem* item) {
294 mUpPropagationItemSet.insert(item);
295 return this;
296 }
297
298 COptimizedKPSetRoleTestingItem* COptimizedKPSetRoleTestingItem::addDownPropagationItem(COptimizedKPSetRoleTestingItem* item) {
299 mDownPropagationItemSet.insert(item);
300 return this;
301 }
302
303
304 bool COptimizedKPSetRoleTestingItem::isPossibleSubsumptionMapInitialized() {
305 return mPossSubsumMapInitialized;
306 }
307
308 COptimizedKPSetRoleTestingItem* COptimizedKPSetRoleTestingItem::setPossibleSubsumptionMapInitialized(bool initialized) {
309 mPossSubsumMapInitialized = initialized;
310 return this;
311 }
312
313 bool COptimizedKPSetRoleTestingItem::isPropagationConnected() {
314 return mPropagationConnected;
315 }
316
317 COptimizedKPSetRoleTestingItem* COptimizedKPSetRoleTestingItem::setPropagationConnected(bool connected) {
318 mPropagationConnected = connected;
319 return this;
320 }
321
322
323 QSet<COptimizedKPSetRoleTestingItem*>* COptimizedKPSetRoleTestingItem::getPossibleSubsumerSet(bool create) {
324 if (create && !mPossibleSubsumedSet) {
325 mPossibleSubsumedSet = new QSet<COptimizedKPSetRoleTestingItem*>();
326 }
327 return mPossibleSubsumedSet;
328 }
329
330 QList<COptimizedKPSetRoleTestingItem*>* COptimizedKPSetRoleTestingItem::getPossibleSubsumerList() {
331 return mPossibleSubsumedList;
332 }
333
334 COptimizedKPSetRoleTestingItem* COptimizedKPSetRoleTestingItem::setPossibleSubsumedList(QList<COptimizedKPSetRoleTestingItem*>* possSubsumedList) {
335 mPossibleSubsumedList = possSubsumedList;
336 return this;
337 }
338
339 bool COptimizedKPSetRoleTestingItem::hasRemainingPossibleSubsumedItems() {
340 return mPossibleSubsumedList && !mPossibleSubsumedList->isEmpty();
341 }
342
343
344
345
346
347 }; // end namespace Classifier
348
349 }; // end namespace Reasoner
350
351 }; // end namespace Konclude