| 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 |
#ifndef KONCLUDE_REASONER_CLASSIFIER_COPTIMIZEDKPSETCLASSONTOLOGYCLASSIFICATIONITEM_H |
| 22 |
#define KONCLUDE_REASONER_CLASSIFIER_COPTIMIZEDKPSETCLASSONTOLOGYCLASSIFICATIONITEM_H |
| 23 |
|
| 24 |
// Libraries includes |
| 25 |
|
| 26 |
|
| 27 |
// Namespace includes |
| 28 |
#include "ClassifierSettings.h" |
| 29 |
#include "COntologyClassClassificationItem.h" |
| 30 |
#include "COptimizedKPSetClassTestingItem.h" |
| 31 |
|
| 32 |
|
| 33 |
// Other includes |
| 34 |
#include "Reasoner/Ontology/CConceptReferenceLinking.h" |
| 35 |
|
| 36 |
|
| 37 |
// Logger includes |
| 38 |
#include "Logger/CLogger.h" |
| 39 |
|
| 40 |
|
| 41 |
namespace Konclude { |
| 42 |
|
| 43 |
namespace Reasoner { |
| 44 |
|
| 45 |
using namespace Ontology; |
| 46 |
|
| 47 |
namespace Classifier { |
| 48 |
|
| 49 |
|
| 50 |
/*! |
| 51 |
* |
| 52 |
* \class COptimizedKPSetClassOntologyClassificationItem |
| 53 |
* \author Andreas Steigmiller |
| 54 |
* \version 0.1 |
| 55 |
* \brief TODO |
| 56 |
* |
| 57 |
*/ |
| 58 |
class COptimizedKPSetClassOntologyClassificationItem : public COntologyClassClassificationItem { |
| 59 |
// public methods |
| 60 |
public: |
| 61 |
//! Constructor |
| 62 |
COptimizedKPSetClassOntologyClassificationItem(CConfigurationBase *configuration, CClassifierStatistics *nextClassificationStatistics = 0); |
| 63 |
|
| 64 |
//! Destructor |
| 65 |
virtual ~COptimizedKPSetClassOntologyClassificationItem(); |
| 66 |
|
| 67 |
QHash<CConcept*,COptimizedKPSetClassTestingItem*>* getConceptSatisfiableTestItemHash(); |
| 68 |
QList<COptimizedKPSetClassTestingItem*>* getConceptSatisfiableTestItemContainer(); |
| 69 |
COptimizedKPSetClassTestingItem* getTopConceptSatisfiableTestItem(); |
| 70 |
COptimizedKPSetClassTestingItem* getBottomConceptSatisfiableTestItem(); |
| 71 |
|
| 72 |
QList<COptimizedKPSetClassTestingItem*>* getNextSatisfiableTestingItemList(); |
| 73 |
QSet<COptimizedKPSetClassTestingItem*>* getNextCandidateSatisfiableTestingItemSet(); |
| 74 |
QSet<COptimizedKPSetClassTestingItem*>* getRemainingCandidateSatisfiableTestingItemSet(); |
| 75 |
|
| 76 |
QList<COptimizedKPSetClassTestingItem*>* getNextPossibleSubsumptionTestingItemList(); |
| 77 |
QSet<COptimizedKPSetClassTestingItem*>* getCurrentPossibleSubsumptionTestingItemSet(); |
| 78 |
|
| 79 |
|
| 80 |
COptimizedKPSetClassOntologyClassificationItem* initTopBottomSatisfiableTestingItems(COptimizedKPSetClassTestingItem* topItem, COptimizedKPSetClassTestingItem* bottomItem); |
| 81 |
|
| 82 |
|
| 83 |
COptimizedKPSetClassTestingItem* getConceptSatisfiableTestItem(CConcept* satTestConcept, bool create = false); |
| 84 |
|
| 85 |
|
| 86 |
cint64 getRemainingSatisfiableTestsCount(); |
| 87 |
cint64 getRunningSatisfiableTestsCount(); |
| 88 |
|
| 89 |
COptimizedKPSetClassOntologyClassificationItem* incRemainingSatisfiableTestsCount(cint64 incCount = 1); |
| 90 |
COptimizedKPSetClassOntologyClassificationItem* incRunningSatisfiableTestsCount(cint64 incCount = 1); |
| 91 |
COptimizedKPSetClassOntologyClassificationItem* decRemainingSatisfiableTestsCount(cint64 decCount = 1); |
| 92 |
COptimizedKPSetClassOntologyClassificationItem* decRunningSatisfiableTestsCount(cint64 decCount = 1); |
| 93 |
|
| 94 |
bool hasAllSatisfiableTestsCompleted(); |
| 95 |
bool hasRemainingSatisfiableTests(); |
| 96 |
|
| 97 |
|
| 98 |
QList<COptimizedKPSetClassTestingItem*>* getSatisfiableConceptItemList(); |
| 99 |
COptimizedKPSetClassOntologyClassificationItem* addSatisfiableConceptItem(COptimizedKPSetClassTestingItem* item); |
| 100 |
|
| 101 |
QHash<CConcept*,CClassificationSatisfiableCalculationConceptReferenceLinking*>* getConceptReferenceLinkingDataHash(); |
| 102 |
|
| 103 |
bool hasSatisfiableTestingPhaseFinished(); |
| 104 |
bool hasPossibleSubsumptionTestingPhaseFinished(); |
| 105 |
|
| 106 |
COptimizedKPSetClassOntologyClassificationItem* setSatisfiableTestingPhaseFinished(bool finished); |
| 107 |
COptimizedKPSetClassOntologyClassificationItem* setPossibleSubsumptionTestingPhaseFinished(bool finished); |
| 108 |
|
| 109 |
cint64 hasRemainingPossibleSubsumptionTests(); |
| 110 |
|
| 111 |
cint64 getRemainingPossibleSubsumptionTestsCount(); |
| 112 |
COptimizedKPSetClassOntologyClassificationItem* setRemainingPossibleSubsumptionTestsCount(cint64 testCount); |
| 113 |
COptimizedKPSetClassOntologyClassificationItem* incRemainingPossibleSubsumptionTestsCount(cint64 incCount = 1); |
| 114 |
COptimizedKPSetClassOntologyClassificationItem* decRemainingPossibleSubsumptionTestsCount(cint64 decCount = 1); |
| 115 |
|
| 116 |
COptimizedKPSetClassOntologyClassificationItem* incRunningPossibleSubsumptionTestsCount(cint64 incCount = 1); |
| 117 |
COptimizedKPSetClassOntologyClassificationItem* decRunningPossibleSubsumptionTestsCount(cint64 decCount = 1); |
| 118 |
|
| 119 |
QSet<COptimizedKPSetClassTestingItem*>* getRemainingPossibleSubsumptionClassTestingSet(); |
| 120 |
cint64 getRemainingPossibleSubsumptionClassTestingCount(); |
| 121 |
|
| 122 |
QSet<CConcept*>* getEquivaltentConceptNonCandidateSet(); |
| 123 |
CBOXHASH<CConcept*,CConcept*>* getEquivalentConceptCandidateHash(); |
| 124 |
|
| 125 |
COptimizedKPSetClassOntologyClassificationItem* addMemoryPools(CMemoryPool* memoryPools); |
| 126 |
CMemoryPool* takeMemoryPools(); |
| 127 |
|
| 128 |
cint64 getCalculatedPossibleSubsumerCount(); |
| 129 |
cint64 getCalculatedTruePossibleSubsumerCount(); |
| 130 |
cint64 getCalculatedFalsePossibleSubsumerCount(); |
| 131 |
|
| 132 |
COptimizedKPSetClassOntologyClassificationItem* setCalculatedPossibleSubsumerCount(cint64 subsumCount); |
| 133 |
COptimizedKPSetClassOntologyClassificationItem* setCalculatedTruePossibleSubsumerCount(cint64 subsumCount); |
| 134 |
COptimizedKPSetClassOntologyClassificationItem* setCalculatedFalsePossibleSubsumerCount(cint64 subsumCount); |
| 135 |
|
| 136 |
COptimizedKPSetClassOntologyClassificationItem* incCalculatedPossibleSubsumerCount(cint64 incSubsumCount = 1); |
| 137 |
COptimizedKPSetClassOntologyClassificationItem* incCalculatedTruePossibleSubsumerCount(cint64 incSubsumCount = 1); |
| 138 |
COptimizedKPSetClassOntologyClassificationItem* incCalculatedFalsePossibleSubsumerCount(cint64 incSubsumCount = 1); |
| 139 |
|
| 140 |
|
| 141 |
cint64 getPossibleSubsumerCount(); |
| 142 |
cint64 getTruePossibleSubsumerCount(); |
| 143 |
cint64 getFalsePossibleSubsumerCount(); |
| 144 |
|
| 145 |
COptimizedKPSetClassOntologyClassificationItem* setPossibleSubsumerCount(cint64 subsumCount); |
| 146 |
COptimizedKPSetClassOntologyClassificationItem* setTruePossibleSubsumerCount(cint64 subsumCount); |
| 147 |
COptimizedKPSetClassOntologyClassificationItem* setFalsePossibleSubsumerCount(cint64 subsumCount); |
| 148 |
|
| 149 |
COptimizedKPSetClassOntologyClassificationItem* incPossibleSubsumerCount(cint64 incSubsumCount = 1); |
| 150 |
COptimizedKPSetClassOntologyClassificationItem* incTruePossibleSubsumerCount(cint64 incSubsumCount = 1); |
| 151 |
COptimizedKPSetClassOntologyClassificationItem* incFalsePossibleSubsumerCount(cint64 incSubsumCount = 1); |
| 152 |
|
| 153 |
// protected methods |
| 154 |
protected: |
| 155 |
|
| 156 |
// protected variables |
| 157 |
protected: |
| 158 |
QHash<CConcept*,COptimizedKPSetClassTestingItem*> mConceptSatItemHash; |
| 159 |
QList<COptimizedKPSetClassTestingItem*> mSatTestItemContainer; |
| 160 |
COptimizedKPSetClassTestingItem* mTopSatTestItem; |
| 161 |
COptimizedKPSetClassTestingItem* mBottomSatTestItem; |
| 162 |
|
| 163 |
QList<COptimizedKPSetClassTestingItem*> mNextItemList; |
| 164 |
QSet<COptimizedKPSetClassTestingItem*> mNextCandItemSet; |
| 165 |
QSet<COptimizedKPSetClassTestingItem*> mRemainingCandItemSet; |
| 166 |
|
| 167 |
QList<COptimizedKPSetClassTestingItem*> mNextPossSubsumItemList; |
| 168 |
QSet<COptimizedKPSetClassTestingItem*> mCurrentPossSubsumItemSet; |
| 169 |
|
| 170 |
QHash<CConcept*,CClassificationSatisfiableCalculationConceptReferenceLinking*> mConceptRefLinkData; |
| 171 |
|
| 172 |
cint64 mRemainingSatTests; |
| 173 |
cint64 mRunningSatTests; |
| 174 |
|
| 175 |
bool mSatisfiableTestingPhaseFinished; |
| 176 |
bool mPossibleSubsumptionTestingPhaseFinished; |
| 177 |
|
| 178 |
cint64 mRemainingPossibleSubsumptionTests; |
| 179 |
cint64 mRunningPossibleSubsumptionTests; |
| 180 |
|
| 181 |
cint64 mCalculatedPossibleSubsumCount; |
| 182 |
cint64 mCalculatedTruePossibleSubsumCount; |
| 183 |
cint64 mCalculatedFalsePossibleSubsumCount; |
| 184 |
|
| 185 |
cint64 mPossibleSubsumCount; |
| 186 |
cint64 mTruePossibleSubsumCount; |
| 187 |
cint64 mFalsePossibleSubsumCount; |
| 188 |
|
| 189 |
QSet<COptimizedKPSetClassTestingItem*> mRemPossClassTestingSet; |
| 190 |
|
| 191 |
QList<COptimizedKPSetClassTestingItem*> mSatisfiableItemList; |
| 192 |
|
| 193 |
QSet<CConcept*> mEquivConNonCandidateSet; |
| 194 |
CBOXHASH<CConcept*,CConcept*> mEquivConCandidateHash; |
| 195 |
|
| 196 |
CMemoryPoolContainer mMemoryPoolContainer; |
| 197 |
|
| 198 |
// private methods |
| 199 |
private: |
| 200 |
|
| 201 |
// private variables |
| 202 |
private: |
| 203 |
|
| 204 |
}; |
| 205 |
|
| 206 |
}; // end namespace Classifier |
| 207 |
|
| 208 |
}; // end namespace Reasoner |
| 209 |
|
| 210 |
}; // end namespace Konclude |
| 211 |
|
| 212 |
#endif // KONCLUDE_REASONER_CLASSIFIER_COPTIMIZEDKPSETCLASSONTOLOGYCLASSIFICATIONITEM_H |