Debian Codegraph @

Source/Reasoner/Classifier/COptimizedKPSetClassTestingItem.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 "COptimizedKPSetClassTestingItem.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Classifier {
29
30
31 COptimizedKPSetClassTestingItem::COptimizedKPSetClassTestingItem() {
32 }
33
34
35 COptimizedKPSetClassTestingItem* COptimizedKPSetClassTestingItem::initSatisfiableTestingItem(CConcept* satTestConcept, QHash<CConcept*,CClassificationSatisfiableCalculationConceptReferenceLinking*>* conRefLinkDataHash) {
36 mConceptSat = satTestConcept;
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 mPseudoModelInitialized = false;
51
52 mPossibleSubsumedList = nullptr;
53 mPossibleSubsumedSet = nullptr;
54
55 mFastSatCacheEntry = nullptr;
56 mSuccFastSatTested = false;
57 mIndiDepTracked = false;
58 mConRefLinkDataHash = conRefLinkDataHash;
59 return this;
60 }
61
62 COptimizedKPSetClassTestingItem::~COptimizedKPSetClassTestingItem() {
63 delete mPossibleSubsumedList;
64 delete mPossibleSubsumedSet;
65 }
66
67 CConcept* COptimizedKPSetClassTestingItem::getTestingConcept() {
68 return mConceptSat;
69 }
70
71 CHierarchyNode* COptimizedKPSetClassTestingItem::getSatisfiableConceptHierarchyNode() {
72 return mConSatHierNode;
73 }
74
75
76 COptimizedKPSetClassTestingItem* COptimizedKPSetClassTestingItem::setSatisfiableConceptHierarchyNode(CHierarchyNode* hierNode) {
77 mConSatHierNode = hierNode;
78 return this;
79 }
80
81
82 QSet<COptimizedKPSetClassTestingItem*>* COptimizedKPSetClassTestingItem::getSubsumingConceptItemSet() {
83 return &mSubsumingConceptItemSet;
84 }
85
86 QList<COptimizedKPSetClassTestingItem*>* COptimizedKPSetClassTestingItem::getSubsumingConceptItemList() {
87 return &mSubsumingConceptItemList;
88 }
89
90
91 cint64 COptimizedKPSetClassTestingItem::getSubsumingConceptItemCount() const {
92 return mSubsumingConceptItemSet.count();
93 }
94
95 bool COptimizedKPSetClassTestingItem::hasSubsumerConceptItem(COptimizedKPSetClassTestingItem* item) {
96 return mSubsumingConceptItemSet.contains(item);
97 }
98
99
100 QList<COptimizedKPSetClassTestingItem*>* COptimizedKPSetClassTestingItem::getSuccessorItemList() {
101 return &mSuccList;
102 }
103
104 cint64 COptimizedKPSetClassTestingItem::getUnprocessedPredecessorItemCount() {
105 return mPredCounter;
106 }
107
108 bool COptimizedKPSetClassTestingItem::hasOnlyProcessedPredecessorItems() {
109 return mPredCounter <= 0;
110 }
111
112 COptimizedKPSetClassTestingItem* COptimizedKPSetClassTestingItem::decUnprocessedPredecessorItems(cint64 decCount) {
113 mPredCounter -= decCount;
114 return this;
115 }
116
117 COptimizedKPSetClassTestingItem* COptimizedKPSetClassTestingItem::incUnprocessedPredecessorItems(cint64 incCount) {
118 mPredCounter += incCount;
119 return this;
120 }
121
122 COptimizedKPSetClassTestingItem* COptimizedKPSetClassTestingItem::setUnprocessedPredecessorItems(cint64 predCount) {
123 mPredCounter = predCount;
124 return this;
125 }
126
127
128 COptimizedKPSetClassTestingItem* COptimizedKPSetClassTestingItem::addSuccessorSatisfiableTestItem(COptimizedKPSetClassTestingItem* succItem) {
129 mSuccList.append(succItem);
130 return this;
131 }
132
133
134 bool COptimizedKPSetClassTestingItem::isSatisfiableTestOrdered() {
135 return mSatTestOrdered;
136 }
137
138 bool COptimizedKPSetClassTestingItem::isSatisfiableTested() {
139 return mTestedSat;
140 }
141
142 bool COptimizedKPSetClassTestingItem::isResultUnsatisfiableDerivated() {
143 return mUnsatDerivated;
144 }
145
146 bool COptimizedKPSetClassTestingItem::isResultSatisfiableDerivated() {
147 return mSatDerivated;
148 }
149
150 bool COptimizedKPSetClassTestingItem::getSatisfiableTestedResult() {
151 return mSatTestedResult;
152 }
153
154 COptimizedKPSetClassTestingItem* COptimizedKPSetClassTestingItem::setSatisfiableTestOrdered(bool satTestOrdered) {
155 mSatTestOrdered = satTestOrdered;
156 return this;
157 }
158
159 COptimizedKPSetClassTestingItem* COptimizedKPSetClassTestingItem::setSatisfiableTested(bool satTested) {
160 mTestedSat = satTested;
161 return this;
162 }
163
164 COptimizedKPSetClassTestingItem* COptimizedKPSetClassTestingItem::setSatisfiableTestedResult(bool satTestedResult) {
165 mSatTestedResult = satTestedResult;
166 return this;
167 }
168
169 COptimizedKPSetClassTestingItem* COptimizedKPSetClassTestingItem::setResultUnsatisfiableDerivated(bool unsatDerivated) {
170 mUnsatDerivated = unsatDerivated;
171 return this;
172 }
173
174 COptimizedKPSetClassTestingItem* COptimizedKPSetClassTestingItem::setResultSatisfiableDerivated(bool satDerivated) {
175 mSatDerivated = satDerivated;
176 return this;
177 }
178
179
180 COptimizedKPSetClassTestingItem* COptimizedKPSetClassTestingItem::addSubsumingConceptItem(COptimizedKPSetClassTestingItem* subsumingItem) {
181 if (!mSubsumingConceptItemSet.contains(subsumingItem)) {
182 mSubsumingConceptItemList.append(subsumingItem);
183 mSubsumingConceptItemSet.insert(subsumingItem);
184
185 //QString iriClassNameString = CIRIName::getRecentIRIName(subsumingItem->getTestingConcept()->getClassNameLinker());
186 //mSubsumingConceptString += QString("%1\r\n").arg(iriClassNameString);
187 }
188 return this;
189 }
190
191
192
193 CConceptSubsumerObserver* COptimizedKPSetClassTestingItem::tellConceptSupsumption(CConcept* subsumedConcept, CConcept* subsumerConcept) {
194 if (subsumerConcept->getOperatorCode() != CCTOP) {
195 CConceptProcessData* conProData = (CConceptProcessData*)subsumerConcept->getConceptData();
196 if (!conProData->isInvalidatedReferenceLinking()) {
197 CConceptSatisfiableReferenceLinkingData* conSatRefLinking = (CConceptSatisfiableReferenceLinkingData*)conProData->getConceptReferenceLinking();
198 if (conSatRefLinking) {
199 COptimizedKPSetClassTestingItem* subsumerClassSaturationItem = (COptimizedKPSetClassTestingItem*)conSatRefLinking->getClassifierReferenceLinkingData();
200 addSubsumingConceptItem(subsumerClassSaturationItem);
201 }
202 } else if (mConRefLinkDataHash) {
203 COptimizedKPSetClassTestingItem* subsumerClasItem = (COptimizedKPSetClassTestingItem*)mConRefLinkDataHash->value(subsumerConcept);
204 addSubsumingConceptItem(subsumerClasItem);
205 }
206 }
207 return this;
208 }
209
210
211 bool itemSortLessThan(const COptimizedKPSetClassTestingItem* item1, const COptimizedKPSetClassTestingItem* item2) {
212 return item1->getSubsumingConceptItemCount() > item2->getSubsumingConceptItemCount();
213 }
214
215 QList<COptimizedKPSetClassTestingItem*>* COptimizedKPSetClassTestingItem::sortSubsumingConceptItemList() {
216 qSort(mSubsumingConceptItemList.begin(),mSubsumingConceptItemList.end(),itemSortLessThan);
217 return &mSubsumingConceptItemList;
218 }
219
220 bool COptimizedKPSetClassTestingItem::isEquivalentItem() {
221 return mEquiItem;
222 }
223
224 COptimizedKPSetClassTestingItem* COptimizedKPSetClassTestingItem::setEquivalentItem(bool equivalent) {
225 mEquiItem = equivalent;
226 return this;
227 }
228
229
230 bool COptimizedKPSetClassTestingItem::isPredecessorItem() {
231 return mPredOfItem;
232 }
233
234 COptimizedKPSetClassTestingItem* COptimizedKPSetClassTestingItem::setPredecessorItem(bool isPredecessorOfOneItem) {
235 mPredOfItem = isPredecessorOfOneItem;
236 return this;
237 }
238
239 bool COptimizedKPSetClassTestingItem::isMoreConceptClassificationInformationRequired() {
240 if (mSatTestOrdered || mTestedSat || mUnsatDerivated || mSatDerivated) {
241 return false;
242 }
243 return true;
244 }
245
246 COptimizedKPSetClassPossibleSubsumptionMap* COptimizedKPSetClassTestingItem::getPossibleSubsumptionMap(bool create) {
247 if (!mPossibleSubsumptionMap && create) {
248 mPossibleSubsumptionMap = new COptimizedKPSetClassPossibleSubsumptionMap();
249 }
250 return mPossibleSubsumptionMap;
251 }
252
253
254 CClassPossibleSubsumptionMap* COptimizedKPSetClassTestingItem::getClassPossibleSubsumptionMap() {
255 return getPossibleSubsumptionMap(false);
256 }
257
258
259 QSet<COptimizedKPSetClassTestingItem*>* COptimizedKPSetClassTestingItem::getUpPropagationItemSet() {
260 return &mUpPropagationItemSet;
261 }
262
263 QSet<COptimizedKPSetClassTestingItem*>* COptimizedKPSetClassTestingItem::getDownPropagationItemSet() {
264 return &mDownPropagationItemSet;
265 }
266
267 COptimizedKPSetClassTestingItem* COptimizedKPSetClassTestingItem::addUpPropagationItem(COptimizedKPSetClassTestingItem* item) {
268 mUpPropagationItemSet.insert(item);
269 return this;
270 }
271
272 COptimizedKPSetClassTestingItem* COptimizedKPSetClassTestingItem::addDownPropagationItem(COptimizedKPSetClassTestingItem* item) {
273 mDownPropagationItemSet.insert(item);
274 return this;
275 }
276
277
278 bool COptimizedKPSetClassTestingItem::isPossibleSubsumptionMapInitialized() {
279 return mPossSubsumMapInitialized;
280 }
281
282 COptimizedKPSetClassTestingItem* COptimizedKPSetClassTestingItem::setPossibleSubsumptionMapInitialized(bool initialized) {
283 mPossSubsumMapInitialized = initialized;
284 return this;
285 }
286
287 bool COptimizedKPSetClassTestingItem::isPropagationConnected() {
288 return mPropagationConnected;
289 }
290
291 COptimizedKPSetClassTestingItem* COptimizedKPSetClassTestingItem::setPropagationConnected(bool connected) {
292 mPropagationConnected = connected;
293 return this;
294 }
295
296 CClassificationClassPseudoModel* COptimizedKPSetClassTestingItem::getClassPseudoModel() {
297 return &mPseudoModel;
298 }
299
300 bool COptimizedKPSetClassTestingItem::isClassPseudoModelInitalized() {
301 return mPseudoModelInitialized;
302 }
303
304 COptimizedKPSetClassTestingItem* COptimizedKPSetClassTestingItem::setClassPseudoModelInitalized(bool initialized) {
305 mPseudoModelInitialized = initialized;
306 return this;
307 }
308
309
310 QSet<COptimizedKPSetClassTestingItem*>* COptimizedKPSetClassTestingItem::getPossibleSubsumedSet(bool create) {
311 if (create && !mPossibleSubsumedSet) {
312 mPossibleSubsumedSet = new QSet<COptimizedKPSetClassTestingItem*>();
313 }
314 return mPossibleSubsumedSet;
315 }
316
317 QList<COptimizedKPSetClassTestingItem*>* COptimizedKPSetClassTestingItem::getPossibleSubsumedList() {
318 return mPossibleSubsumedList;
319 }
320
321 COptimizedKPSetClassTestingItem* COptimizedKPSetClassTestingItem::setPossibleSubsumedList(QList<COptimizedKPSetClassTestingItem*>* possSubsumedList) {
322 mPossibleSubsumedList = possSubsumedList;
323 return this;
324 }
325
326 bool COptimizedKPSetClassTestingItem::hasRemainingPossibleSubsumedItems() {
327 return mPossibleSubsumedList && !mPossibleSubsumedList->isEmpty();
328 }
329
330
331
332 CCacheEntry* COptimizedKPSetClassTestingItem::getFastSatisfiabilityTestedSaturationCacheEntry() {
333 return mFastSatCacheEntry;
334 }
335
336 COptimizedKPSetClassTestingItem* COptimizedKPSetClassTestingItem::setFastSatisfiabilityTestedSaturationCacheEntry(CCacheEntry* cacheEntry) {
337 mFastSatCacheEntry = cacheEntry;
338 return this;
339 }
340
341 bool COptimizedKPSetClassTestingItem::hasSuccessfullyFastSatisfiabilityTested() {
342 return mSuccFastSatTested;
343 }
344
345 COptimizedKPSetClassTestingItem* COptimizedKPSetClassTestingItem::setSuccessfullyFastSatisfiabilityTested(bool successfullyTested) {
346 mSuccFastSatTested = successfullyTested;
347 return this;
348 }
349
350 CIndividualDependenceTrackingMarker* COptimizedKPSetClassTestingItem::setIndividualDependenceTracked() {
351 mIndiDepTracked = true;
352 return this;
353 }
354
355 bool COptimizedKPSetClassTestingItem::hasIndividualDependenceTracked() {
356 return mIndiDepTracked;
357 }
358
359 }; // end namespace Classifier
360
361 }; // end namespace Reasoner
362
363 }; // end namespace Konclude