File: COptimizedKPSetClassTestingItem.h

package info (click to toggle)
konclude 0.7.0%2B1138%2Bgit20220514~dfsg-1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm, forky, sid, trixie
  • size: 48,500 kB
  • sloc: cpp: 378,255; xml: 116,067; sh: 66; makefile: 38; ansic: 3
file content (230 lines) | stat: -rw-r--r-- 8,499 bytes parent folder | download | duplicates (2)
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
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
/*
 *		Copyright (C) 2013-2015, 2019 by the Konclude Developer Team.
 *
 *		This file is part of the reasoning system Konclude.
 *		For details and support, see <http://konclude.com/>.
 *
 *		Konclude is free software: you can redistribute it and/or modify
 *		it under the terms of version 3 of the GNU Lesser General Public
 *		License (LGPLv3) as published by the Free Software Foundation.
 *
 *		Konclude is distributed in the hope that it will be useful,
 *		but WITHOUT ANY WARRANTY; without even the implied warranty of
 *		MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
 *		GNU (Lesser) General Public License for more details.
 *
 *		You should have received a copy of the GNU (Lesser) General Public
 *		License along with Konclude. If not, see <http://www.gnu.org/licenses/>.
 *
 */

#ifndef KONCLUDE_REASONER_CLASSIFIER_COPTIMIZEDKPSETCLASSTESTINGITEM_H
#define KONCLUDE_REASONER_CLASSIFIER_COPTIMIZEDKPSETCLASSTESTINGITEM_H

// Libraries includes


// Namespace includes
#include "ClassifierSettings.h"
#include "COptimizedKPSetClassPossibleSubsumptionMap.h"
#include "CClassificationSatisfiablePossibleSubsumptionCalculationConceptReferenceLinking.h"
#include "CClassificationClassPseudoModel.h"
#include "CConceptSubsumerObserver.h"


// Other includes
#include "Reasoner/Ontology/CConcept.h"
#include "Reasoner/Ontology/CConceptProcessData.h"
#include "Reasoner/Ontology/CConceptSatisfiableReferenceLinkingData.h"

#include "Reasoner/Consistiser/CIndividualDependenceTrackingMarker.h"

#include "Reasoner/Taxonomy/CHierarchyNode.h"

#include "Reasoner/Kernel/Cache/CCacheEntry.h"

// Logger includes
#include "Logger/CLogger.h"


namespace Konclude {

	namespace Reasoner {

		using namespace Ontology;
		using namespace Taxonomy;
		using namespace Consistiser;
		using namespace Kernel::Cache;

		namespace Classifier {


			/*! 
			 *
			 *		\class		COptimizedKPSetClassTestingItem
			 *		\author		Andreas Steigmiller
			 *		\version	0.1
			 *		\brief		TODO
			 *
			 */
			class COptimizedKPSetClassTestingItem : public CClassificationSatisfiablePossibleSubsumptionCalculationConceptReferenceLinking, public CConceptSubsumerObserver, public CIndividualDependenceTrackingMarker {
				// public methods
				public:
					//! Constructor
					COptimizedKPSetClassTestingItem();
					~COptimizedKPSetClassTestingItem();


					COptimizedKPSetClassTestingItem* initSatisfiableTestingItem(CConcept* satTestConcept, QHash<CConcept*,CClassificationSatisfiableCalculationConceptReferenceLinking*>* conRefLinkDataHash);
					CConcept* getTestingConcept();


					CHierarchyNode* getSatisfiableConceptHierarchyNode();
					COptimizedKPSetClassTestingItem* setSatisfiableConceptHierarchyNode(CHierarchyNode* hierNode);

					QSet<COptimizedKPSetClassTestingItem*>* getSubsumingConceptItemSet();
					QList<COptimizedKPSetClassTestingItem*>* getSubsumingConceptItemList();
					cint64 getSubsumingConceptItemCount() const;
					bool hasSubsumerConceptItem(COptimizedKPSetClassTestingItem* item);

					QList<COptimizedKPSetClassTestingItem*>* getSuccessorItemList();
					cint64 getUnprocessedPredecessorItemCount();

					bool hasOnlyProcessedPredecessorItems();
					COptimizedKPSetClassTestingItem* decUnprocessedPredecessorItems(cint64 decCount = 1);
					COptimizedKPSetClassTestingItem* incUnprocessedPredecessorItems(cint64 incCount = 1);
					COptimizedKPSetClassTestingItem* setUnprocessedPredecessorItems(cint64 predCount);

					COptimizedKPSetClassTestingItem* addSuccessorSatisfiableTestItem(COptimizedKPSetClassTestingItem* succItem);

					bool isSatisfiableTestOrdered();
					bool isSatisfiableTested();
					bool isResultUnsatisfiableDerivated();
					bool isResultSatisfiableDerivated();
					bool getSatisfiableTestedResult();

					COptimizedKPSetClassTestingItem* setSatisfiableTestOrdered(bool satTestOrdered);
					COptimizedKPSetClassTestingItem* setSatisfiableTested(bool satTested);
					COptimizedKPSetClassTestingItem* setResultUnsatisfiableDerivated(bool unsatDerivated);
					COptimizedKPSetClassTestingItem* setResultSatisfiableDerivated(bool satDerivated);
					COptimizedKPSetClassTestingItem* setSatisfiableTestedResult(bool satTestedResult);


					COptimizedKPSetClassTestingItem* addSubsumingConceptItem(COptimizedKPSetClassTestingItem* subsumingItem);
					CConceptSubsumerObserver* tellConceptSupsumption(CConcept* subsumedConcept, CConcept* subsumerConcept);


					QList<COptimizedKPSetClassTestingItem*>* sortSubsumingConceptItemList();

					bool isEquivalentItem();
					COptimizedKPSetClassTestingItem* setEquivalentItem(bool equivalent);

					bool isPredecessorItem();
					COptimizedKPSetClassTestingItem* setPredecessorItem(bool isPredecessorOfOneItem);

					bool isMoreConceptClassificationInformationRequired();

					COptimizedKPSetClassPossibleSubsumptionMap* getPossibleSubsumptionMap(bool create = false);


					QSet<COptimizedKPSetClassTestingItem*>* getUpPropagationItemSet();
					QSet<COptimizedKPSetClassTestingItem*>* getDownPropagationItemSet();
					COptimizedKPSetClassTestingItem* addUpPropagationItem(COptimizedKPSetClassTestingItem* item);
					COptimizedKPSetClassTestingItem* addDownPropagationItem(COptimizedKPSetClassTestingItem* item);
					bool isPropagationConnected();
					COptimizedKPSetClassTestingItem* setPropagationConnected(bool connected);


					virtual CClassPossibleSubsumptionMap* getClassPossibleSubsumptionMap();
					bool isPossibleSubsumptionMapInitialized();
					COptimizedKPSetClassTestingItem* setPossibleSubsumptionMapInitialized(bool initialized);

					CClassificationClassPseudoModel* getClassPseudoModel();
					bool isClassPseudoModelInitalized();
					COptimizedKPSetClassTestingItem* setClassPseudoModelInitalized(bool initialized);



					QSet<COptimizedKPSetClassTestingItem*>* getPossibleSubsumedSet(bool create);
					QList<COptimizedKPSetClassTestingItem*>* getPossibleSubsumedList();
					COptimizedKPSetClassTestingItem* setPossibleSubsumedList(QList<COptimizedKPSetClassTestingItem*>* possSubsumedList);
					bool hasRemainingPossibleSubsumedItems();




					CCacheEntry* getFastSatisfiabilityTestedSaturationCacheEntry();
					COptimizedKPSetClassTestingItem* setFastSatisfiabilityTestedSaturationCacheEntry(CCacheEntry* cacheEntry);
					
					bool hasSuccessfullyFastSatisfiabilityTested();
					COptimizedKPSetClassTestingItem* setSuccessfullyFastSatisfiabilityTested(bool successfullyTested);

					virtual CIndividualDependenceTrackingMarker* setIndividualDependenceTracked();
					bool hasIndividualDependenceTracked();

				// protected methods
				protected:

				// protected variables
				protected:
					CConcept* mConceptSat;
					CHierarchyNode* mConSatHierNode;

					QSet<COptimizedKPSetClassTestingItem*> mSubsumingConceptItemSet;
					QList<COptimizedKPSetClassTestingItem*> mSubsumingConceptItemList;

					QList<COptimizedKPSetClassTestingItem*> mSuccList;
					cint64 mPredCounter;

					// true, if the satisfiability testing for this concept has started
					bool mSatTestOrdered;
					// true, if the satisfiability testing has finished
					bool mTestedSat;
					// true, if for a super concept the unsatisfiability has been discovered
					bool mUnsatDerivated;
					// true, if for the concept the satisfiability has been extracted from a completion graph
					bool mSatDerivated;
					// true of false if the concept is satisfiable respectively unsatisfiable
					bool mSatTestedResult;

					bool mPropagationConnected;
					QSet<COptimizedKPSetClassTestingItem*> mUpPropagationItemSet;
					QSet<COptimizedKPSetClassTestingItem*> mDownPropagationItemSet;


					QSet<COptimizedKPSetClassTestingItem*>* mPossibleSubsumedSet;
					QList<COptimizedKPSetClassTestingItem*>* mPossibleSubsumedList;


					bool mEquiItem;
					bool mPredOfItem;

					COptimizedKPSetClassPossibleSubsumptionMap* mPossibleSubsumptionMap;
					bool mPossSubsumMapInitialized;

					//QString mSubsumingConceptString;
					CClassificationClassPseudoModel mPseudoModel;
					bool mPseudoModelInitialized;

					CCacheEntry* mFastSatCacheEntry;
					bool mSuccFastSatTested;

					bool mIndiDepTracked;

					QHash<CConcept*,CClassificationSatisfiableCalculationConceptReferenceLinking*>* mConRefLinkDataHash;

				// private methods
				private:

				// private variables
				private:

			};

		}; // end namespace Classifier

	}; // end namespace Reasoner

}; // end namespace Konclude

#endif // KONCLUDE_REASONER_CLASSIFIER_COPTIMIZEDKPSETCLASSTESTINGITEM_H