| 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_CONSISTISER_CTOTALLYONTOLOGYPRECOMPUTATIONITEM_H |
| 22 |
#define KONCLUDE_REASONER_CONSISTISER_CTOTALLYONTOLOGYPRECOMPUTATIONITEM_H |
| 23 |
|
| 24 |
// Libraries includes |
| 25 |
#include <QAtomicPointer> |
| 26 |
|
| 27 |
// Namespace includes |
| 28 |
#include "ConsistiserSettings.h" |
| 29 |
#include "CConsistenceObserver.h" |
| 30 |
#include "CSaturationObserver.h" |
| 31 |
#include "COntologyPrecomputationItem.h" |
| 32 |
#include "CPrecomputationTestingStep.h" |
| 33 |
#include "CSaturationConceptDataItem.h" |
| 34 |
#include "CSaturationIndividualDataItem.h" |
| 35 |
#include "CSaturationIndividualAnalysationObserver.h" |
| 36 |
#include "CIndividualPrecomputationCoordinationHash.h" |
| 37 |
#include "CIndividualPrecomputationTestingItem.h" |
| 38 |
|
| 39 |
|
| 40 |
// Other includes |
| 41 |
#include "Reasoner/Consistence/CConsistenceData.h" |
| 42 |
#include "Reasoner/Consistence/CSaturationData.h" |
| 43 |
#include "Reasoner/Consistence/CConsistence.h" |
| 44 |
|
| 45 |
#include "Reasoner/Ontology/OntologySettings.h" |
| 46 |
#include "Reasoner/Ontology/COntologyProcessingStepRequirement.h" |
| 47 |
#include "Reasoner/Ontology/CConceptProcessData.h" |
| 48 |
#include "Reasoner/Ontology/CIndividualProcessData.h" |
| 49 |
#include "Reasoner/Ontology/CConceptSaturationReferenceLinkingData.h" |
| 50 |
#include "Reasoner/Ontology/COntologyProcessingConceptSaturationRequirement.h" |
| 51 |
#include "Reasoner/Ontology/CIndividualReference.h" |
| 52 |
|
| 53 |
#include "Reasoner/Kernel/Task/CCalculationConfigurationExtension.h" |
| 54 |
#include "Reasoner/Kernel/Cache/CBackendIndividualRetrievalComputationUpdateCoordinationHash.h" |
| 55 |
|
| 56 |
#include "Reasoner/Query/CApproximatedSaturationCalculationJob.h" |
| 57 |
|
| 58 |
// Logger includes |
| 59 |
#include "Logger/CLogger.h" |
| 60 |
|
| 61 |
|
| 62 |
namespace Konclude { |
| 63 |
|
| 64 |
namespace Reasoner { |
| 65 |
|
| 66 |
using namespace Kernel::Task; |
| 67 |
using namespace Kernel::Cache; |
| 68 |
using namespace Consistence; |
| 69 |
using namespace Ontology; |
| 70 |
using namespace Query; |
| 71 |
|
| 72 |
namespace Consistiser { |
| 73 |
|
| 74 |
|
| 75 |
typedef QPair<CRole*,TConceptNegPair> TRoleConceptNegTriple; |
| 76 |
|
| 77 |
|
| 78 |
/*! |
| 79 |
* |
| 80 |
* \class CTotallyOntologyPrecomputationItem |
| 81 |
* \author Andreas Steigmiller |
| 82 |
* \version 0.1 |
| 83 |
* \brief TODO |
| 84 |
* |
| 85 |
*/ |
| 86 |
class CTotallyOntologyPrecomputationItem : public COntologyPrecomputationItem, public CConsistenceObserver, public CSaturationObserver, public CSaturationIndividualAnalysationObserver { |
| 87 |
// public methods |
| 88 |
public: |
| 89 |
//! Constructor |
| 90 |
CTotallyOntologyPrecomputationItem(); |
| 91 |
~CTotallyOntologyPrecomputationItem(); |
| 92 |
|
| 93 |
CTotallyOntologyPrecomputationItem* initTotallyPrecomputationItem(CConcreteOntology* ontology, CConfigurationBase* config); |
| 94 |
|
| 95 |
virtual COntologyPrecomputationItem* addPrecomputationRequirement(COntologyProcessingRequirement* ontoRequirement); |
| 96 |
|
| 97 |
CTotallyOntologyPrecomputationItem* setConsistenceCheched(bool consistenceChecked); |
| 98 |
bool hasConsistenceCheched(); |
| 99 |
|
| 100 |
CTotallyOntologyPrecomputationItem* setConsistenceCheckCreated(bool consistenceCheckCreated); |
| 101 |
bool hasConsistenceCheckCreated(); |
| 102 |
|
| 103 |
virtual CConsistenceObserver* tellConsistenceData(CConsistenceData* consData); |
| 104 |
CConsistenceData* getConsistenceData(); |
| 105 |
virtual CSaturationObserver* tellSaturationData(CSaturationData* saturationData); |
| 106 |
CSaturationData* getSaturationData(); |
| 107 |
|
| 108 |
CConsistence* getConsistence(); |
| 109 |
CTotallyOntologyPrecomputationItem* setConsistence(CConsistence* consistence); |
| 110 |
|
| 111 |
CCalculationConfigurationExtension* getCalculationConfiguration(); |
| 112 |
|
| 113 |
CTotallyOntologyPrecomputationItem* setPrecomputation(CPrecomputation* precomputation); |
| 114 |
CPrecomputation* getPrecomputation(); |
| 115 |
CTotallyOntologyPrecomputationItem* setConceptCyclePrecomputationInitialized(bool initialized); |
| 116 |
bool hasConceptCyclePrecomputationInitialized(); |
| 117 |
CTotallyOntologyPrecomputationItem* setConceptCyclePrecomputationChecked(bool checked); |
| 118 |
bool hasConceptCyclePrecomputationChecked(); |
| 119 |
QList<CConceptCycleData*>* getRemainingConceptCyclePrecomputationList(); |
| 120 |
CTotallyOntologyPrecomputationItem* addRemainingConceptCyclePrecomputation(CConceptCycleData* conceptCycleData); |
| 121 |
bool hasRemainingConceptCyclePrecomputation(); |
| 122 |
|
| 123 |
CTotallyOntologyPrecomputationItem* setConceptSaturationPrecomputationCreated(bool initialized); |
| 124 |
bool hasConceptSaturationPrecomputationCreated(); |
| 125 |
CTotallyOntologyPrecomputationItem* setConceptSaturationPrecomputationChecked(bool checked); |
| 126 |
bool hasConceptSaturationPrecomputationChecked(); |
| 127 |
|
| 128 |
|
| 129 |
|
| 130 |
|
| 131 |
|
| 132 |
CSaturationIndividualAnalysationObserver* notifyClashedIndividual(); |
| 133 |
CSaturationIndividualAnalysationObserver* notifyInsufficientIndividual(); |
| 134 |
|
| 135 |
|
| 136 |
bool hasClashedSaturationIndividuals(); |
| 137 |
bool hasInsufficientSaturationIndividuals(); |
| 138 |
|
| 139 |
|
| 140 |
bool isForceCompletionGraphConstruction(); |
| 141 |
CTotallyOntologyPrecomputationItem* setForceCompletionGraphConstruction(bool forceCompletionGraphConstruction); |
| 142 |
bool isFullCompletionGraphConstruction(); |
| 143 |
CTotallyOntologyPrecomputationItem* setFullCompletionGraphConstruction(bool fullCompletionGraphConstruction); |
| 144 |
bool isFullCompletionGraphConstructed(); |
| 145 |
CTotallyOntologyPrecomputationItem* setFullCompletionGraphConstructed(bool fullCompletionGraphConstructed); |
| 146 |
|
| 147 |
|
| 148 |
|
| 149 |
bool hasIndividualsSaturated(); |
| 150 |
CTotallyOntologyPrecomputationItem* setIndividualsSaturated(bool saturated); |
| 151 |
|
| 152 |
bool hasALLIndividualsSaturationOrderd(); |
| 153 |
CTotallyOntologyPrecomputationItem* setALLIndividualsSaturationOrderd(bool allSaturationOrderd); |
| 154 |
|
| 155 |
bool failAfterConsistencyConceptSaturation(); |
| 156 |
bool failAfterConsistencyChecking(); |
| 157 |
bool failAfterConceptSaturation(); |
| 158 |
|
| 159 |
|
| 160 |
|
| 161 |
bool requiresAllConceptsSaturation(); |
| 162 |
bool hasAllConceptsSaturationOrdered(); |
| 163 |
CTotallyOntologyPrecomputationItem* setAllConceptsSaturationOrdered(bool ordered); |
| 164 |
QList<CSaturationConceptDataItem*>* getSaturationOrderedItemList(); |
| 165 |
bool hasRemainingRequiredSaturationConcepts(); |
| 166 |
QList<TConceptNegPair>* getRemainingRequiredSaturationConceptList(); |
| 167 |
CTotallyOntologyPrecomputationItem* addRequiredSaturationConcept(CConcept* concept, bool negation); |
| 168 |
|
| 169 |
bool requiresNominalDelayedConceptsSaturationUpdate(); |
| 170 |
CTotallyOntologyPrecomputationItem* setNominalDelayedConceptsSaturationUpdateRequired(bool updateRequired); |
| 171 |
|
| 172 |
bool hasNominalDelayedConceptsSaturationUpdated(); |
| 173 |
CTotallyOntologyPrecomputationItem* setNominalDelayedConceptsSaturationUpdated(bool updated); |
| 174 |
|
| 175 |
bool hasRemainingConsistencyRequiredSaturationConcepts(); |
| 176 |
QList<TConceptNegPair>* getRemainingConsistencyRequiredSaturationConceptList(); |
| 177 |
CTotallyOntologyPrecomputationItem* addConsistencyRequiredSaturationConcept(CConcept* concept, bool negation); |
| 178 |
|
| 179 |
|
| 180 |
bool hasRemainingRequiredSaturationIndividuals(); |
| 181 |
bool hasRemainingRequiredABoxSaturationIndividuals(); |
| 182 |
QList<CIndividual*>* getRemainingRequiredABoxSaturationIndividuals(); |
| 183 |
CTotallyOntologyPrecomputationItem* addRequiredABoxSaturationIndividual(CIndividual* individual); |
| 184 |
CTotallyOntologyPrecomputationItem* setTripleIndexedIndividualSaturated(bool saturated); |
| 185 |
CTotallyOntologyPrecomputationItem* setRequiredABoxSaturationIndividualLinker(CXLinker<CIndividual*>* individualLinker); |
| 186 |
bool hasRequiredABoxSaturationIndividualLinker(); |
| 187 |
cint64 getRemainingRequiredABoxSaturationIndividualCount(); |
| 188 |
CTotallyOntologyPrecomputationItem* setRemainingRequiredABoxSaturationIndividualCount(cint64 count); |
| 189 |
CTotallyOntologyPrecomputationItem* decRemainingRequiredABoxSaturationIndividualCount(cint64 count = 1); |
| 190 |
|
| 191 |
CIndividual* getNextRequiredABoxSaturationIndividual(bool moveNext = true); |
| 192 |
CTotallyOntologyPrecomputationItem* addRequiredABoxSaturationIndividualLinkerArray(CXLinker<CIndividual*>* individualLinkerArray); |
| 193 |
CTotallyOntologyPrecomputationItem* clearRequiredABoxSaturationIndividualLinkerArrays(); |
| 194 |
|
| 195 |
|
| 196 |
cint64 getHandledTriplesIndividualSaturatedId(); |
| 197 |
CTotallyOntologyPrecomputationItem* setHandledTriplesIndividualSaturatedId(cint64 handledId); |
| 198 |
|
| 199 |
|
| 200 |
|
| 201 |
cint64 getMinConceptCycleTestSize(); |
| 202 |
CTotallyOntologyPrecomputationItem* setMinConceptCycleTestSize(cint64 minSize); |
| 203 |
|
| 204 |
CPrecomputationTestingStep* getConsistencePrecomputationStep(); |
| 205 |
bool isConsistenceStepFinished(); |
| 206 |
bool isConsistenceStepRequired(); |
| 207 |
bool areConsistenceStepProcessingRequirementSatisfied(); |
| 208 |
|
| 209 |
|
| 210 |
CPrecomputationTestingStep* getCyclePrecomputationStep(); |
| 211 |
bool isCycleStepFinished(); |
| 212 |
bool isCycleStepRequired(); |
| 213 |
bool areCycleStepProcessingRequirementSatisfied(); |
| 214 |
|
| 215 |
CPrecomputationTestingStep* getSaturationPrecomputationStep(); |
| 216 |
bool isSaturationStepRunning(); |
| 217 |
bool isSaturationStepFinished(); |
| 218 |
bool isSaturationStepRequired(); |
| 219 |
bool areSaturationStepProcessingRequirementSatisfied(); |
| 220 |
|
| 221 |
|
| 222 |
|
| 223 |
CTotallyOntologyPrecomputationItem* setSaturationStepRunning(bool satStepRunning); |
| 224 |
|
| 225 |
bool isSaturationComputationRunning(); |
| 226 |
CTotallyOntologyPrecomputationItem* setSaturationComputationRunning(bool satCompRunning); |
| 227 |
|
| 228 |
|
| 229 |
CTotallyOntologyPrecomputationItem* setSaturationOccurrenceStatisticsCollectingInitialized(bool initialized); |
| 230 |
bool hasSaturationOccurrenceStatisticsCollectingInitialized(); |
| 231 |
CTotallyOntologyPrecomputationItem* setSaturationOccurrenceStatisticsCollected(bool checked); |
| 232 |
bool hasSaturationOccurrenceStatisticsCollected(); |
| 233 |
|
| 234 |
CPrecomputationTestingStep* getOccurrenceStatisticsPrecomputationStep(); |
| 235 |
bool isOccurrenceStatisticsStepFinished(); |
| 236 |
bool isOccurrenceStatisticsStepRequired(); |
| 237 |
bool areOccurrenceStatisticsStepProcessingRequirementSatisfied(); |
| 238 |
|
| 239 |
|
| 240 |
|
| 241 |
|
| 242 |
CPrecomputationTestingStep* getIndividualPrecomputationStep(); |
| 243 |
bool isIndividualStepRunning(); |
| 244 |
bool isIndividualStepFinished(); |
| 245 |
bool isIndividualStepRequired(); |
| 246 |
bool areIndividualStepProcessingRequirementSatisfied(); |
| 247 |
CTotallyOntologyPrecomputationItem* setIndividualStepRunning(bool satStepRunning); |
| 248 |
|
| 249 |
|
| 250 |
cint64 getIndividualComputationRunningCount(); |
| 251 |
bool isIndividualComputationRunning(); |
| 252 |
CTotallyOntologyPrecomputationItem* setIndividualComputationRunning(bool indiCompRunning); |
| 253 |
CTotallyOntologyPrecomputationItem* incIndividualComputationRunningCount(cint64 incCount = 1); |
| 254 |
CTotallyOntologyPrecomputationItem* decIndividualComputationRunningCount(cint64 decCount = 1); |
| 255 |
|
| 256 |
|
| 257 |
CTotallyOntologyPrecomputationItem* setAllIndividualPrecomputationCreated(bool initialized); |
| 258 |
bool hasAllIndividualPrecomputationCreated(); |
| 259 |
CTotallyOntologyPrecomputationItem* setIndividualPrecomputationChecked(bool checked); |
| 260 |
bool hasIndividualPrecomputationChecked(); |
| 261 |
|
| 262 |
CTotallyOntologyPrecomputationItem* setIndividualPrecomputationClashed(bool checked); |
| 263 |
bool hasIndividualPrecomputationClashed(); |
| 264 |
bool* getIndividualPrecomputationClashedPointer(); |
| 265 |
bool* getIndividualPrecomputationExpansionLimitedReachedPointer(); |
| 266 |
|
| 267 |
|
| 268 |
|
| 269 |
|
| 270 |
CTotallyOntologyPrecomputationItem* incIndividualSaturationRunningCount(cint64 incCount = 1); |
| 271 |
CTotallyOntologyPrecomputationItem* decIndividualSaturationRunningCount(cint64 decCount = 1); |
| 272 |
cint64 getIndividualSaturationRunningCount(); |
| 273 |
bool hasIndividualSaturationRunning(); |
| 274 |
|
| 275 |
|
| 276 |
bool areAllStepFinished(); |
| 277 |
bool hasRemainingProcessingRequirements(); |
| 278 |
|
| 279 |
CSaturationConceptDataItem* getSaturationConceptDataItem(CConcept* satConcept, bool negated, bool create); |
| 280 |
CSaturationConceptDataItem* getSaturationRoleSuccessorConceptDataItem(CRole* role, CConcept* satConcept, bool negated, bool create); |
| 281 |
|
| 282 |
CApproximatedSaturationCalculationJob* getSaturationCalculationJob(); |
| 283 |
CTotallyOntologyPrecomputationItem* setSaturationCalculationJob(CApproximatedSaturationCalculationJob* calculationJob); |
| 284 |
|
| 285 |
|
| 286 |
QSet<CConcept*>* getSaturatedDisjunctionSet(); |
| 287 |
CTotallyOntologyPrecomputationItem* addSaturatedDisjunction(CConcept* disjunctionConcept); |
| 288 |
|
| 289 |
CIndividual* getAllAssertionIndividual(); |
| 290 |
CTotallyOntologyPrecomputationItem* setAllAssertionIndividual(CIndividual* individual); |
| 291 |
|
| 292 |
bool isAllAssertionIndividualSaturated(); |
| 293 |
CTotallyOntologyPrecomputationItem* setAllAssertionIndividualSaturated(bool saturated); |
| 294 |
|
| 295 |
bool hasAllAssertionIndividualSufficientSaturationChecked(); |
| 296 |
CTotallyOntologyPrecomputationItem* setAllAssertionIndividualSufficientSaturationChecked(bool sufficientSaturatedChecked); |
| 297 |
|
| 298 |
bool isAllAssertionIndividualSaturationSufficient(); |
| 299 |
CTotallyOntologyPrecomputationItem* setAllAssertionIndividualSaturationSufficient(bool sufficientSaturated); |
| 300 |
|
| 301 |
|
| 302 |
CSaturationIndividualDataItem* takeFreeSaturationIndividualDataItem(bool create = true); |
| 303 |
CTotallyOntologyPrecomputationItem* addFreeSaturationIndividualDataItem(CSaturationIndividualDataItem* item); |
| 304 |
|
| 305 |
CTotallyOntologyPrecomputationItem* setSaturationIDIndividualDataItems(cint64 saturationID, CSaturationIndividualDataItem* items); |
| 306 |
CTotallyOntologyPrecomputationItem* releaseSaturationIDIndividualDataItems(cint64 saturationID); |
| 307 |
cint64 getNextSaturationID(bool moveNext = true); |
| 308 |
|
| 309 |
|
| 310 |
|
| 311 |
bool hasIndividualsSaturationCacheSynchronisation(); |
| 312 |
CTotallyOntologyPrecomputationItem* setIndividualsSaturationCacheSynchronisation(bool synchronized); |
| 313 |
|
| 314 |
|
| 315 |
|
| 316 |
bool hasIndividualsSaturationAllOrderedCacheRetrieved(); |
| 317 |
CTotallyOntologyPrecomputationItem* setIndividualsSaturationAllOrderedCacheRetrieved(bool retrieved); |
| 318 |
|
| 319 |
|
| 320 |
|
| 321 |
CIndividualPrecomputationCoordinationHash* getCurrentIndividualComputationCoordinationHash(); |
| 322 |
CTotallyOntologyPrecomputationItem* setCurrentIndividualComputationCoordinationHash(CIndividualPrecomputationCoordinationHash* coordHash); |
| 323 |
QSet<CIndividualReference>* getCurrentIndividualComputationSet(); |
| 324 |
|
| 325 |
QSet<CIndividualReference>* getIncompletelyHandledIndividualSet(); |
| 326 |
cint64 getCurrentIncompletelyHandledIndividualRetrievalLimit(); |
| 327 |
CTotallyOntologyPrecomputationItem* setCurrentIncompletelyHandledIndividualRetrievalLimit(cint64 limit); |
| 328 |
double getCurrentIncompletelyHandledIndividualRetrievalThresholdFactor(); |
| 329 |
cint64 getCurrentIncompletelyHandledIndividualRetrievalThreshold(); |
| 330 |
CTotallyOntologyPrecomputationItem* setCurrentIncompletelyHandledIndividualRetrievalThreshold(cint64 threshold); |
| 331 |
bool hasAllIncompletelyHandledIndividualsRetrieved(); |
| 332 |
CTotallyOntologyPrecomputationItem* setAllIncompletelyHandledIndividualsRetrieved(bool allRetrieved); |
| 333 |
|
| 334 |
|
| 335 |
bool hasFirstIncompletelyHandledIndividualsRetrieved(); |
| 336 |
CTotallyOntologyPrecomputationItem* setFirstIncompletelyHandledIndividualsRetrieved(bool retrieved); |
| 337 |
|
| 338 |
|
| 339 |
cint64 getLastMinimumRetrievedIncompletelyHandledIndividualId(); |
| 340 |
CTotallyOntologyPrecomputationItem* setLastMinimumRetrievedIncompletelyHandledIndividualId(cint64 minId); |
| 341 |
|
| 342 |
cint64 getIndividualSaturationSizeLimit(); |
| 343 |
|
| 344 |
cint64 getCurrentIncompletelyHandledIndividualComputationLimit(); |
| 345 |
CTotallyOntologyPrecomputationItem* setCurrentIncompletelyHandledIndividualComputationLimit(cint64 limit); |
| 346 |
|
| 347 |
|
| 348 |
double getMaximumRecomputationExpansionPropagationCuttedReductionFactor(); |
| 349 |
double getCurrentRecomputationExpansionPropagationCuttedReductionFactor(); |
| 350 |
CTotallyOntologyPrecomputationItem* setCurrentRecomputationExpansionPropagationCuttedReductionFactor(double redFac); |
| 351 |
CTotallyOntologyPrecomputationItem* incCurrentRecomputationExpansionPropagationCuttedReductionFactor(double redFac); |
| 352 |
CTotallyOntologyPrecomputationItem* decCurrentRecomputationExpansionPropagationCuttedReductionFactor(double redFac); |
| 353 |
double getRecomputationExpansionPropagationCuttedReductionIncreaseFactor(); |
| 354 |
double getRecomputationExpansionPropagationCuttedReductionRecoveryFactor(); |
| 355 |
|
| 356 |
cint64 getRecomputationExpansionPropagationCuttedCount(); |
| 357 |
CTotallyOntologyPrecomputationItem* incRecomputationExpansionPropagationCuttedCount(cint64 count); |
| 358 |
|
| 359 |
|
| 360 |
|
| 361 |
double getRemainingIncompletelyHandlingIndividualComputationLimitIncreasingCount(); |
| 362 |
CTotallyOntologyPrecomputationItem* setRemainingIncompletelyHandlingIndividualComputationLimitIncreasingCount(cint64 indiCount); |
| 363 |
|
| 364 |
double getIncompletelyHandlingIndividualComputationLimitIncreasingFactor(); |
| 365 |
|
| 366 |
|
| 367 |
|
| 368 |
QTime* getInitializationTime(); |
| 369 |
QTime*& getIndividualSaturationTime(); |
| 370 |
QTime*& getIndividualPrecomputationTime(); |
| 371 |
|
| 372 |
|
| 373 |
cint64 getNextRepresentativeCacheRecomputationId(); |
| 374 |
|
| 375 |
|
| 376 |
|
| 377 |
bool isPrecompuationRetrievingIncompletelyHandledIndividuals(); |
| 378 |
CTotallyOntologyPrecomputationItem* setPrecompuationRetrievingIncompletelyHandledIndividuals(bool retrievingIndividuals); |
| 379 |
|
| 380 |
|
| 381 |
cint64 getNonPrecompuationDirectIncompletelyHandledIndividualsRetrievingStreakSize(); |
| 382 |
CTotallyOntologyPrecomputationItem* setNonPrecompuationDirectIncompletelyHandledIndividualsRetrievingStreakSize(bool straekSize); |
| 383 |
CTotallyOntologyPrecomputationItem* incNonPrecompuationDirectIncompletelyHandledIndividualsRetrievingStreakSize(bool incStreakSize = 1); |
| 384 |
|
| 385 |
|
| 386 |
|
| 387 |
bool isPrecompuationIncompletelyHandledIndividualsRetrievalThresholdRequested(); |
| 388 |
CTotallyOntologyPrecomputationItem* setPrecompuationIncompletelyHandledIndividualsRetrievalThresholdRequested(bool retrievalRequested); |
| 389 |
|
| 390 |
|
| 391 |
CIndividualPrecomputationCoordinationHash* getPrecomputationProcessingCoordinationHash(); |
| 392 |
CIndividualPrecomputationCoordinationHash* getPrecomputationRetrievalCoordinationHash(); |
| 393 |
CTotallyOntologyPrecomputationItem* setPrecomputationProcessingCoordinationHash(CIndividualPrecomputationCoordinationHash* coordHash); |
| 394 |
CTotallyOntologyPrecomputationItem* setPrecomputationRetrievalCoordinationHash(CIndividualPrecomputationCoordinationHash* coordHash); |
| 395 |
|
| 396 |
|
| 397 |
CTotallyOntologyPrecomputationItem* setPrecomputationProcessingCoordinationHashIteratorCurrent(CIndividualPrecomputationCoordinationHash::const_iterator coordHashIt); |
| 398 |
CIndividualPrecomputationCoordinationHash::const_iterator getPrecomputationProcessingCoordinationHashIteratorCurrent(); |
| 399 |
|
| 400 |
CTotallyOntologyPrecomputationItem* setPrecomputationProcessingCoordinationHashIteratorEnd(CIndividualPrecomputationCoordinationHash::const_iterator coordHashIt); |
| 401 |
CIndividualPrecomputationCoordinationHash::const_iterator getPrecomputationProcessingCoordinationHashIteratorEnd(); |
| 402 |
|
| 403 |
|
| 404 |
bool hadBasicPrecompuationMode(); |
| 405 |
CTotallyOntologyPrecomputationItem* setBasicPrecompuationMode(bool basicMode); |
| 406 |
|
| 407 |
double getBasicPrecompuationSubsequentIndividualLimitReductionFactor(); |
| 408 |
CTotallyOntologyPrecomputationItem* setBasicPrecompuationSubsequentIndividualLimitReductionFactor(double factor); |
| 409 |
|
| 410 |
|
| 411 |
double getBasicPrecompuationSubsequentIndividualLimitReductionInitializationFactor(); |
| 412 |
double getBasicPrecompuationSubsequentIndividualLimitReductionIncreasingFactor(); |
| 413 |
|
| 414 |
QMap<cint64, CIndividualPrecomputationTestingItem*>* getRecomputationIdTestingItemMap(); |
| 415 |
cint64 getMaxHandledRecomputationIdRemainingReporting(); |
| 416 |
CTotallyOntologyPrecomputationItem* setMaxHandledRecomputationIdRemainingReporting(cint64 remainingCount); |
| 417 |
CTotallyOntologyPrecomputationItem* decMaxHandledRecomputationIdRemainingReporting(cint64 count = 1); |
| 418 |
|
| 419 |
|
| 420 |
double getBasicPrecompuationParallelizationReductionFactor(); |
| 421 |
CTotallyOntologyPrecomputationItem* setBasicPrecompuationParallelizationReductionFactor(double factor); |
| 422 |
|
| 423 |
double getBasicPrecompuationParallelizationInitializationFactor(); |
| 424 |
double getBasicPrecompuationParallelizationIncreasingFactor(); |
| 425 |
|
| 426 |
|
| 427 |
// protected methods |
| 428 |
protected: |
| 429 |
|
| 430 |
// protected variables |
| 431 |
protected: |
| 432 |
CConsistence* mConsistence; |
| 433 |
bool mConsistenceCheckCreated; |
| 434 |
bool mConsistenceCheched; |
| 435 |
QAtomicPointer<CConsistenceData> mConsData; |
| 436 |
QAtomicPointer<CSaturationData> mSaturData; |
| 437 |
QMutex mSaturDataAddMutex; |
| 438 |
QList<CSaturationData*> mSaturDataList; |
| 439 |
CSaturationData* mLastSaturData; |
| 440 |
|
| 441 |
CPrecomputation* mPrecomputation; |
| 442 |
bool mConceptCyclePrecomputationInitialized; |
| 443 |
bool mConceptCyclePrecomputationChecked; |
| 444 |
QList<CConceptCycleData*> mRemainingConceptCyclePrecomputationList; |
| 445 |
cint64 mMinConceptCycleTestSize; |
| 446 |
|
| 447 |
bool mFailAfterConsistencyConceptSaturation; |
| 448 |
bool mFailAfterConsistencyChecking; |
| 449 |
bool mFailAfterConceptSaturation; |
| 450 |
|
| 451 |
bool mSaturationTestRunning; |
| 452 |
bool mSaturationComputationRunning; |
| 453 |
bool mIndividualTestRunning; |
| 454 |
|
| 455 |
cint64 mIndividualSaturationRunningCount; |
| 456 |
cint64 mIndividualComputationRunningCount; |
| 457 |
bool mIndividualComputationRunning; |
| 458 |
bool mIndividualPrecomputationCreated; |
| 459 |
bool mIndividualPrecomputationChecked; |
| 460 |
bool mIndividualPrecomputationClashed; |
| 461 |
bool mIndividualPrecomputationExpansionLimitedReachedPointer; |
| 462 |
|
| 463 |
CPrecomputationTestingStep* mConsistencePrecomputationStep; |
| 464 |
CPrecomputationTestingStep* mCyclePrecomputationStep; |
| 465 |
CPrecomputationTestingStep* mOccurrenceStatisticsPrecomputationStep; |
| 466 |
CPrecomputationTestingStep* mSaturationPrecomputationStep; |
| 467 |
CPrecomputationTestingStep* mIndividualPrecomputationStep; |
| 468 |
QList<CPrecomputationTestingStep*> mProcessingSteps; |
| 469 |
|
| 470 |
QSet<CConcept*> mDisjunctionSaturationSet; |
| 471 |
|
| 472 |
|
| 473 |
bool mConceptSaturationPrecomputationCreated; |
| 474 |
bool mConceptSaturationPrecomputationChecked; |
| 475 |
QHash<TConceptNegPair,CSaturationConceptDataItem*> mConceptNegationSatItemHash; |
| 476 |
QHash<TRoleConceptNegTriple,CSaturationConceptDataItem*> mRoleConceptNegationSatItemHash; |
| 477 |
QList<CSaturationConceptDataItem*> mSatItemContainer; |
| 478 |
QList<CSaturationConceptDataItem*> mSatOrderedItemList; |
| 479 |
bool mAllConSatRequired; |
| 480 |
bool mAllConSatOrdered; |
| 481 |
QList<TConceptNegPair> mRemainingReqSatConList; |
| 482 |
QList<TConceptNegPair> mRemainingConsReqSatConList; |
| 483 |
bool mNomDelayedConSatUpRequired; |
| 484 |
bool mNomDelayedConSatUpdated; |
| 485 |
|
| 486 |
QList<CIndividual*> mRemainingABoxIndiSatList; |
| 487 |
CXLinker<CIndividual*>* mRemainingABoxIndiSatLinker; |
| 488 |
QList<CXLinker<CIndividual*>*> mRemainingABoxIndiSatLinkerArrayList; |
| 489 |
cint64 mHandledTriplesIndiSaturatedId; |
| 490 |
bool mTriplesIndexedIndisSaturated; |
| 491 |
|
| 492 |
|
| 493 |
CApproximatedSaturationCalculationJob* mApproxSatCalcJob; |
| 494 |
|
| 495 |
CCalculationConfigurationExtension* mCalculationConfig; |
| 496 |
|
| 497 |
CIndividual* mAllAssertionIndividual; |
| 498 |
bool mAllAssertionIndividualSaturated; |
| 499 |
bool mAllAssertionIndividualSufficientSaturationChecked; |
| 500 |
bool mAllAssertionIndividualSaturationSufficient; |
| 501 |
|
| 502 |
CSaturationIndividualDataItem* mFreeItemLinker; |
| 503 |
QHash<cint64,CSaturationIndividualDataItem*> mSatIDIndividualItemsHash; |
| 504 |
cint64 mNextSaturationID; |
| 505 |
|
| 506 |
bool mIndividualSaturationClashed; |
| 507 |
bool mIndividualSaturationInsufficient; |
| 508 |
bool mIndividualSaturated; |
| 509 |
bool mAllIndividualSaturaturationOrderd; |
| 510 |
|
| 511 |
bool mIndividualsSaturationCacheSynchronisation; |
| 512 |
bool mIndividualsSaturationAllOrderedCacheRetrieved; |
| 513 |
QSet<CIndividualReference> mIncompHandledIndiSet; |
| 514 |
QSet<CIndividualReference> mCurrentIndiComputationSet; |
| 515 |
CIndividualPrecomputationCoordinationHash* mCurrentIndiCompCoordHash; |
| 516 |
cint64 mCurrentIncompIndiRetrievalLimit; |
| 517 |
cint64 mCurrentIncompIndiRetrievalThreshold; |
| 518 |
double mCurrentIncompIndiRetrievalThresholdFactor; |
| 519 |
bool mAllIncompIndiRetrieved; |
| 520 |
bool mFirstIncompletelyHandledIndividualsRetrieved; |
| 521 |
cint64 mLastMinRetrievedIncompIndiId; |
| 522 |
cint64 mCurrentIncompIndiComputationLimit; |
| 523 |
|
| 524 |
double mMaximumRecomputationExpansionPropagationCuttedReductionFactor; |
| 525 |
double mCurrentRecomputationExpansionPropagationCuttedReductionFactor; |
| 526 |
double mRecomputationExpansionPropagationCuttedReductionIncreaseFactor; |
| 527 |
double mRecomputationExpansionPropagationCuttedReductionRecoveryFactor; |
| 528 |
|
| 529 |
cint64 mIncompletelyHandledIndividualComputationPropagationCutReservedSize; |
| 530 |
cint64 mRemainingIncompletelyHandlingIndividualComputationLimitIncreasingCount; |
| 531 |
double mIncompletelyHandlingIndividualComputationLimitIncreasingFactor; |
| 532 |
cint64 mIndividualSaturationCount; |
| 533 |
|
| 534 |
cint64 mNextRepresentativeCacheRecomputationId = 1; |
| 535 |
cint64 mRemainingRequiredABoxSaturationIndividualCount = 0; |
| 536 |
|
| 537 |
|
| 538 |
QTime mInitTime; |
| 539 |
QTime* mIndividualSaturationTime; |
| 540 |
QTime* mIndividualPrecomputationTime; |
| 541 |
|
| 542 |
|
| 543 |
bool mSaturationOccurrenceStatisticsCollected; |
| 544 |
bool mSaturationOccurrenceStatisticsCollectingInitialized; |
| 545 |
|
| 546 |
|
| 547 |
bool mForceCompletionGraphConstruction; |
| 548 |
bool mFullCompletionGraphConstruction; |
| 549 |
bool mFullCompletionGraphConstructed; |
| 550 |
|
| 551 |
|
| 552 |
bool mPrecompuationIncompletelyHandledIndividualsRetrievalThresholdRequested; |
| 553 |
bool mPrecompuationRetrievingIncompletelyHandledIndividuals; |
| 554 |
CIndividualPrecomputationCoordinationHash* mPrecomputationProcessingCoordinationHash; |
| 555 |
CIndividualPrecomputationCoordinationHash* mPrecomputationRetrievalCoordinationHash; |
| 556 |
|
| 557 |
CIndividualPrecomputationCoordinationHash::const_iterator mPrecomputationProcessingCoordinationHashIteratorCurrent; |
| 558 |
CIndividualPrecomputationCoordinationHash::const_iterator mPrecomputationProcessingCoordinationHashIteratorEnd; |
| 559 |
|
| 560 |
|
| 561 |
bool mHadBasicPrecompuationMode; |
| 562 |
double mBasicPrecompuationSubsequentIndividualLimitReductionFactor; |
| 563 |
double mBasicPrecompuationSubsequentIndividualLimitReductionInitializationFactor; |
| 564 |
double mBasicPrecompuationSubsequentIndividualLimitReductionIncreasingFactor; |
| 565 |
|
| 566 |
cint64 mNonPrecompuationDirectIncompletelyHandledIndividualsRetrievingStreakSize; |
| 567 |
|
| 568 |
QMap<cint64, CIndividualPrecomputationTestingItem*> mRecomputationIdTestingItemMap; |
| 569 |
cint64 mMaxHandledRecomputationIdRemainingReporting; |
| 570 |
|
| 571 |
|
| 572 |
|
| 573 |
double mBasicPrecompuationParallelizationReductionFactor; |
| 574 |
double mBasicPrecompuationParallelizationInitializationFactor; |
| 575 |
double mBasicPrecompuationParallelizationIncreasingFactor; |
| 576 |
|
| 577 |
|
| 578 |
|
| 579 |
// private methods |
| 580 |
private: |
| 581 |
|
| 582 |
// private variables |
| 583 |
private: |
| 584 |
|
| 585 |
}; |
| 586 |
|
| 587 |
}; // end namespace Consistiser |
| 588 |
|
| 589 |
}; // end namespace Reasoner |
| 590 |
|
| 591 |
}; // end namespace Konclude |
| 592 |
|
| 593 |
#endif // KONCLUDE_REASONER_CONSISTISER_CTOTALLYONTOLOGYPRECOMPUTATIONITEM_H |