Debian Codegraph @

Source/Reasoner/Classifier/COptimizedSubClassSatisfiableTestingItem.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 "COptimizedSubClassSatisfiableTestingItem.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Classifier {
29
30
31 COptimizedSubClassSatisfiableTestingItem::COptimizedSubClassSatisfiableTestingItem() {
32 }
33
34
35 COptimizedSubClassSatisfiableTestingItem* COptimizedSubClassSatisfiableTestingItem::initSatisfiableTestingItem(CConcept* satTestConcept) {
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 mFastSatCacheEntry = nullptr;
48 mSuccFastSatTested = false;
49 mIndiDepTracked = false;
50 return this;
51 }
52
53 CConcept* COptimizedSubClassSatisfiableTestingItem::getSatisfiableConcept() {
54 return mConceptSat;
55 }
56
57 CHierarchyNode* COptimizedSubClassSatisfiableTestingItem::getSatisfiableConceptHierarchyNode() {
58 return mConSatHierNode;
59 }
60
61 COptimizedSubClassSatisfiableTestingItem* COptimizedSubClassSatisfiableTestingItem::setSatisfiableConceptHierarchyNode(CHierarchyNode* hierNode) {
62 mConSatHierNode = hierNode;
63 return this;
64 }
65
66
67 QSet<COptimizedSubClassSatisfiableTestingItem*>* COptimizedSubClassSatisfiableTestingItem::getSubsumingConceptItemSet() {
68 return &mSubsumingConceptItemSet;
69 }
70
71 QList<COptimizedSubClassSatisfiableTestingItem*>* COptimizedSubClassSatisfiableTestingItem::getSubsumingConceptItemList() {
72 return &mSubsumingConceptItemList;
73 }
74
75
76 cint64 COptimizedSubClassSatisfiableTestingItem::getSubsumingConceptItemCount() const {
77 return mSubsumingConceptItemSet.count();
78 }
79
80
81 QList<COptimizedSubClassSatisfiableTestingItem*>* COptimizedSubClassSatisfiableTestingItem::getSuccessorItemList() {
82 return &mSuccList;
83 }
84
85 cint64 COptimizedSubClassSatisfiableTestingItem::getUnprocessedPredecessorItemCount() {
86 return mPredCounter;
87 }
88
89 bool COptimizedSubClassSatisfiableTestingItem::hasOnlyProcessedPredecessorItems() {
90 return mPredCounter <= 0;
91 }
92
93 COptimizedSubClassSatisfiableTestingItem* COptimizedSubClassSatisfiableTestingItem::decUnprocessedPredecessorItems(cint64 decCount) {
94 mPredCounter -= decCount;
95 return this;
96 }
97
98 COptimizedSubClassSatisfiableTestingItem* COptimizedSubClassSatisfiableTestingItem::incUnprocessedPredecessorItems(cint64 incCount) {
99 mPredCounter += incCount;
100 return this;
101 }
102
103 COptimizedSubClassSatisfiableTestingItem* COptimizedSubClassSatisfiableTestingItem::setUnprocessedPredecessorItems(cint64 count) {
104 mPredCounter = count;
105 return this;
106 }
107
108 COptimizedSubClassSatisfiableTestingItem* COptimizedSubClassSatisfiableTestingItem::addSuccessorSatisfiableTestItem(COptimizedSubClassSatisfiableTestingItem* succItem) {
109 mSuccList.append(succItem);
110 return this;
111 }
112
113
114 bool COptimizedSubClassSatisfiableTestingItem::isSatisfiableTestOrdered() {
115 return mSatTestOrdered;
116 }
117
118 bool COptimizedSubClassSatisfiableTestingItem::isSatisfiableTested() {
119 return mTestedSat;
120 }
121
122 bool COptimizedSubClassSatisfiableTestingItem::isResultUnsatisfiableDerivated() {
123 return mUnsatDerivated;
124 }
125
126 bool COptimizedSubClassSatisfiableTestingItem::isResultSatisfiableDerivated() {
127 return mSatDerivated;
128 }
129
130 bool COptimizedSubClassSatisfiableTestingItem::getSatisfiableTestedResult() {
131 return mSatTestedResult;
132 }
133
134 COptimizedSubClassSatisfiableTestingItem* COptimizedSubClassSatisfiableTestingItem::setSatisfiableTestOrdered(bool satTestOrdered) {
135 mSatTestOrdered = satTestOrdered;
136 return this;
137 }
138
139 COptimizedSubClassSatisfiableTestingItem* COptimizedSubClassSatisfiableTestingItem::setSatisfiableTested(bool satTested) {
140 mTestedSat = satTested;
141 return this;
142 }
143
144 COptimizedSubClassSatisfiableTestingItem* COptimizedSubClassSatisfiableTestingItem::setSatisfiableTestedResult(bool satTestedResult) {
145 mSatTestedResult = satTestedResult;
146 return this;
147 }
148
149 COptimizedSubClassSatisfiableTestingItem* COptimizedSubClassSatisfiableTestingItem::setResultUnsatisfiableDerivated(bool unsatDerivated) {
150 mUnsatDerivated = unsatDerivated;
151 return this;
152 }
153
154 COptimizedSubClassSatisfiableTestingItem* COptimizedSubClassSatisfiableTestingItem::setResultSatisfiableDerivated(bool satDerivated) {
155 mSatDerivated = satDerivated;
156 return this;
157 }
158
159
160 COptimizedSubClassSatisfiableTestingItem* COptimizedSubClassSatisfiableTestingItem::addSubsumingConceptItem(COptimizedSubClassSatisfiableTestingItem* subsumingItem) {
161 if (!mSubsumingConceptItemSet.contains(subsumingItem)) {
162 mSubsumingConceptItemList.append(subsumingItem);
163 mSubsumingConceptItemSet.insert(subsumingItem);
164
165 //QString iriClassNameString = CIRIName::getRecentIRIName(subsumingItem->getSatisfiableConcept()->getClassNameLinker());
166 //mSubsumingConceptString += QString("%1\r\n").arg(iriClassNameString);
167 }
168 return this;
169 }
170
171
172
173 CConceptSubsumerObserver* COptimizedSubClassSatisfiableTestingItem::tellConceptSupsumption(CConcept* subsumedConcept, CConcept* subsumerConcept) {
174 if (subsumerConcept->getOperatorCode() != CCTOP) {
175 CConceptProcessData* conProData = (CConceptProcessData*)subsumerConcept->getConceptData();
176 CConceptSatisfiableReferenceLinkingData* conSatRefLinking = (CConceptSatisfiableReferenceLinkingData*)conProData->getConceptReferenceLinking();
177 if (conSatRefLinking) {
178 COptimizedSubClassSatisfiableTestingItem* subsumerClassSaturationItem = (COptimizedSubClassSatisfiableTestingItem*)conSatRefLinking->getClassifierReferenceLinkingData();
179 addSubsumingConceptItem(subsumerClassSaturationItem);
180 }
181 }
182 return this;
183 }
184
185
186 bool itemSortLessThan(const COptimizedSubClassSatisfiableTestingItem* item1, const COptimizedSubClassSatisfiableTestingItem* item2) {
187 return item1->getSubsumingConceptItemCount() > item2->getSubsumingConceptItemCount();
188 }
189
190 QList<COptimizedSubClassSatisfiableTestingItem*>* COptimizedSubClassSatisfiableTestingItem::sortSubsumingConceptItemList() {
191 qSort(mSubsumingConceptItemList.begin(),mSubsumingConceptItemList.end(),itemSortLessThan);
192 return &mSubsumingConceptItemList;
193 }
194
195 bool COptimizedSubClassSatisfiableTestingItem::isEquivalentItem() {
196 return mEquiItem;
197 }
198
199 COptimizedSubClassSatisfiableTestingItem* COptimizedSubClassSatisfiableTestingItem::setEquivalentItem(bool equivalent) {
200 mEquiItem = equivalent;
201 return this;
202 }
203
204
205 bool COptimizedSubClassSatisfiableTestingItem::isPredecessorItem() {
206 return mPredOfItem;
207 }
208
209 COptimizedSubClassSatisfiableTestingItem* COptimizedSubClassSatisfiableTestingItem::setPredecessorItem(bool isPredecessorOfOneItem) {
210 mPredOfItem = isPredecessorOfOneItem;
211 return this;
212 }
213
214 bool COptimizedSubClassSatisfiableTestingItem::isMoreConceptClassificationInformationRequired() {
215 if (mSatTestOrdered || mTestedSat || mUnsatDerivated || mSatDerivated) {
216 return false;
217 }
218 return true;
219 }
220
221
222 CCacheEntry* COptimizedSubClassSatisfiableTestingItem::getFastSatisfiabilityTestedSaturationCacheEntry() {
223 return mFastSatCacheEntry;
224 }
225
226 COptimizedSubClassSatisfiableTestingItem* COptimizedSubClassSatisfiableTestingItem::setFastSatisfiabilityTestedSaturationCacheEntry(CCacheEntry* cacheEntry) {
227 mFastSatCacheEntry = cacheEntry;
228 return this;
229 }
230
231 bool COptimizedSubClassSatisfiableTestingItem::hasSuccessfullyFastSatisfiabilityTested() {
232 return mSuccFastSatTested;
233 }
234
235 COptimizedSubClassSatisfiableTestingItem* COptimizedSubClassSatisfiableTestingItem::setSuccessfullyFastSatisfiabilityTested(bool successfullyTested) {
236 mSuccFastSatTested = successfullyTested;
237 return this;
238 }
239
240 CIndividualDependenceTrackingMarker* COptimizedSubClassSatisfiableTestingItem::setIndividualDependenceTracked() {
241 mIndiDepTracked = true;
242 return this;
243 }
244
245 bool COptimizedSubClassSatisfiableTestingItem::hasIndividualDependenceTracked() {
246 return mIndiDepTracked;
247 }
248 }; // end namespace Classifier
249
250 }; // end namespace Reasoner
251
252 }; // end namespace Konclude