/* * Copyright (C) 2013-2015, 2019 by the Konclude Developer Team. * * This file is part of the reasoning system Konclude. * For details and support, see . * * 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 . * */ #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* conRefLinkDataHash); CConcept* getTestingConcept(); CHierarchyNode* getSatisfiableConceptHierarchyNode(); COptimizedKPSetClassTestingItem* setSatisfiableConceptHierarchyNode(CHierarchyNode* hierNode); QSet* getSubsumingConceptItemSet(); QList* getSubsumingConceptItemList(); cint64 getSubsumingConceptItemCount() const; bool hasSubsumerConceptItem(COptimizedKPSetClassTestingItem* item); QList* 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* sortSubsumingConceptItemList(); bool isEquivalentItem(); COptimizedKPSetClassTestingItem* setEquivalentItem(bool equivalent); bool isPredecessorItem(); COptimizedKPSetClassTestingItem* setPredecessorItem(bool isPredecessorOfOneItem); bool isMoreConceptClassificationInformationRequired(); COptimizedKPSetClassPossibleSubsumptionMap* getPossibleSubsumptionMap(bool create = false); QSet* getUpPropagationItemSet(); QSet* 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* getPossibleSubsumedSet(bool create); QList* getPossibleSubsumedList(); COptimizedKPSetClassTestingItem* setPossibleSubsumedList(QList* 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 mSubsumingConceptItemSet; QList mSubsumingConceptItemList; QList 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 mUpPropagationItemSet; QSet mDownPropagationItemSet; QSet* mPossibleSubsumedSet; QList* mPossibleSubsumedList; bool mEquiItem; bool mPredOfItem; COptimizedKPSetClassPossibleSubsumptionMap* mPossibleSubsumptionMap; bool mPossSubsumMapInitialized; //QString mSubsumingConceptString; CClassificationClassPseudoModel mPseudoModel; bool mPseudoModelInitialized; CCacheEntry* mFastSatCacheEntry; bool mSuccFastSatTested; bool mIndiDepTracked; QHash* mConRefLinkDataHash; // private methods private: // private variables private: }; }; // end namespace Classifier }; // end namespace Reasoner }; // end namespace Konclude #endif // KONCLUDE_REASONER_CLASSIFIER_COPTIMIZEDKPSETCLASSTESTINGITEM_H