Debian Codegraph @

Source/Reasoner/Kernel/Algorithm/CSatisfiableTaskClassificationMessageAnalyser.h

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 #ifndef KONCLUDE_REASONER_KERNEL_ALGORITHM_CSATISFIABLETASKCLASSIFICATIONMESSAGEANALYSER_H
22 #define KONCLUDE_REASONER_KERNEL_ALGORITHM_CSATISFIABLETASKCLASSIFICATIONMESSAGEANALYSER_H
23
24 // Libraries includes
25
26
27 // Namespace includes
28 #include "CCalculationAlgorithmContext.h"
29
30 // Other includes
31 #include "Context/CContextBase.h"
32
33 #include "Reasoner/Classifier/CClassificationMessageDataObserver.h"
34 #include "Reasoner/Classifier/CClassificationClassSubsumptionMessageData.h"
35 #include "Reasoner/Classifier/CClassificationClassSubsumptionMessageData.h"
36 #include "Reasoner/Classifier/CClassificationUpdatePossibleClassSubsumptionMessageData.h"
37 #include "Reasoner/Classifier/CClassificationInitializePossibleClassSubsumptionMessageData.h"
38 #include "Reasoner/Classifier/CClassificationMessageData.h"
39 #include "Reasoner/Classifier/CClassificationSatisfiableCalculationConceptReferenceLinking.h"
40 #include "Reasoner/Classifier/CClassificationSatisfiablePossibleSubsumptionCalculationConceptReferenceLinking.h"
41 #include "Reasoner/Classifier/CClassificationPseudoModelIdentifierMessageData.h"
42
43 #include "Reasoner/Consistiser/CSaturationConceptDataItem.h"
44
45 #include "Reasoner/Kernel/Task/CSatisfiableCalculationTask.h"
46
47 #include "Reasoner/Kernel/Process/Dependency/CDependencyTrackPoint.h"
48 #include "Reasoner/Kernel/Process/Dependency/CDependencyNode.h"
49 #include "Reasoner/Kernel/Process/CIndividualProcessNode.h"
50 #include "Reasoner/Kernel/Process/CIndividualSaturationProcessNode.h"
51
52 #include "Reasoner/Ontology/CConceptProcessData.h"
53 #include "Reasoner/Ontology/CConceptSatisfiableReferenceLinkingData.h"
54 #include "Reasoner/Ontology/CConceptSaturationReferenceLinkingData.h"
55
56 // Logger includes
57 #include "Logger/CLogger.h"
58
59
60
61 namespace Konclude {
62
63 using namespace Context;
64
65 namespace Reasoner {
66
67 using namespace Consistiser;
68 using namespace Classifier;
69 using namespace Ontology;
70
71 namespace Kernel {
72
73 using namespace Task;
74 using namespace Process::Dependency;
75
76 namespace Algorithm {
77
78 /*!
79 *
80 * \class CSatisfiableTaskClassificationMessageAnalyser
81 * \author Andreas Steigmiller
82 * \version 0.1
83 * \brief TODO
84 *
85 */
86 class CSatisfiableTaskClassificationMessageAnalyser {
87 // public methods
88 public:
89 //! Constructor
90 CSatisfiableTaskClassificationMessageAnalyser();
91
92 bool readCalculationConfig(CCalculationConfigurationExtension *config);
93 bool analyseSatisfiableTask(CSatisfiableCalculationTask* statCalcTask, CCalculationAlgorithmContext* calcAlgContext);
94
95 CIndividualProcessNode* getCorrectedIndividualID(CIndividualProcessNode* baseIndiNode, CIndividualProcessNodeVector* indiNodeVec, bool* nondetMergedFlag);
96
97
98 void checkCanHaveClashWithModel(CIndividualProcessNode* indiNode, CConcept* concept, bool negated, bool& clashFoundFlag, bool& unknownFlag, bool& clashFreeFlag, cint64 depth, QSet<CIndividualProcessNode*>* testedIndividualsSet, CIndividualProcessNode* lastNode, CIndividualProcessNodeVector* indiNodeVec);
99 void verifySubsumptionPossibleWithModel(CIndividualProcessNode* indiNode, CConcept* testingConcept, CClassificationMessageData* possSubsumMessageData, CCLASSSUBSUMPTIONMESSAGELIST<CConcept*>* subsumerList);
100
101
102 // protected methods
103 protected:
104 CClassificationMessageData* extractPossibleSubsumptionInformation(CConceptDescriptor* conDes, CIndividualProcessNode* indiNode, CReapplyConceptLabelSet* conSet, CCalculationAlgorithmContext* calcAlgContext);
105
106 // protected variables
107 protected:
108
109 class CSaturatedMergedTestItem {
110 public:
111 CSaturatedMergedTestItem() {
112 mSuccessfullyMerged = false;
113 mSatisfiableMerged = false;
114 }
115 public:
116 bool mSuccessfullyMerged;
117 bool mSatisfiableMerged;
118 };
119
120
121 class CConceptNegationTriggerItem {
122 public:
123 CConceptNegationTriggerItem() {
124 mTriggerFlag = false;
125 mNegationFlag = false;
126 mConcept = nullptr;
127 mIndiSatNode = nullptr;
128 }
129 public:
130 bool mTriggerFlag;
131 bool mNegationFlag;
132 CConcept* mConcept;
133 CIndividualSaturationProcessNode* mIndiSatNode;
134 };
135
136
137
138 class CIndividualAnalyseProcessItem {
139 public:
140 CIndividualAnalyseProcessItem* initIndividualAnalyseProcessItem(cint64 indiID = 0, cint64 rootDistance = 0, CIndividualAnalyseProcessItem* ancItem = nullptr, CIndividualLinkEdge* ancLink = nullptr) {
141 mRootDistance = rootDistance;
142 mAncItem = ancItem;
143 mIndiID = indiID;
144 mAncLink = ancLink;
145 return this;
146 }
147 public:
148 cint64 mIndiID;
149 cint64 mRootDistance;
150 CIndividualLinkEdge* mAncLink;
151 CIndividualAnalyseProcessItem* mAncItem;
152 };
153
154
155
156 class CPseudoModelAnalyseProcessItem {
157 public:
158 CPseudoModelAnalyseProcessItem* initPseudoModelAnalyseProcessItem(cint64 pmModelID = 0, cint64 rootDistance = 0) {
159 mPMModelID = pmModelID;
160 mRootDistance = rootDistance;
161 mNodeLinker = nullptr;
162 return this;
163 }
164 CPseudoModelAnalyseProcessItem* addNodeLinker(CXNegLinker<CIndividualProcessNode*>* nodeLinker) {
165 if (nodeLinker) {
166 mNodeLinker = nodeLinker->append(mNodeLinker);
167 }
168 return this;
169 }
170 public:
171 cint64 mPMModelID;
172 cint64 mRootDistance;
173 CXNegLinker<CIndividualProcessNode*>* mNodeLinker;
174 };
175
176
177 typedef QPair<CConcept*,bool> TConceptNegationPair;
178
179
180 bool mConfAnalyseSubSumptions;
181 bool mConfAnalyseAllSubSumptions;
182 bool mConfAnalyseIdentifierOccurence;
183 bool mConfAnalysePossibleSubSumptions;
184 bool mEquivalentAlternativesSaturationMerging;
185
186
187 bool mConfStopAnalyseWhenNotChanging;
188
189
190 cint64 mMaxModelAnalysingDepth;
191 cint64 mMaxPossibleSubsumerNegationCheckingDepth;
192
193 cint64 mMaxSaturatedModelMergingTestRecursionDepth;
194
195 CClassPossibleSubsumptionMapIterator* mReusePossSubsumMapIterator;
196
197
198 CPROCESSINGHASH< CConcept*,CCLASSPOSSIBLESUBSUMPTIONMESSAGELIST<CClassificationInitializePossibleClassSubsumptionData*>* >* mMultiplePossSubsumInitAvoidHash;
199 bool mUseAlwaysConRefLinkDataHash;
200 QHash<CConcept*,CClassificationSatisfiableCalculationConceptReferenceLinking*>* mConRefLinkDataHash;
201 CTaskMemoryPoolAllocationManager* mTempMemAllocMan;
202 CContextBase* mTmpContext;
203 CSatisfiableCalculationTask* mStatCalcTask;
204
205
206 CTaskMemoryPoolAllocationManager* mPMTempMemAllocMan;
207 CContextBase* mPMTmpContext;
208 cint64 mMaxPseudoModelDepth;
209 cint64 mMaxPseudoModelNodes;
210
211
212 cint64 mStatConsideredOtherNodeCount;
213 cint64 mStatExtractedPossibleSubsumerOtherNodeCount;
214
215 cint64 mStatSuccessorModelMergingTestCount;
216
217
218
219 CPROCESSINGHASH< QPair<CConcept*,bool>,CSaturatedMergedTestItem >* mTestSaturatedMergedHash;
220 CIndividualProcessNode* mLastMergingTestNode;
221
222 // private methods
223 private:
224 CConceptDescriptor* getIndividualProcessNodeConceptWithSingleAncestorDependency(CIndividualProcessNode* indiNode, CIndividualAnalyseProcessItem* indiAnProcItem, CCalculationAlgorithmContext* calcAlgContext);
225 bool hasDependencyToAncestor(CIndividualProcessNode* individualNode, CDependencyTrackPoint* depTrackPoint, CCalculationAlgorithmContext* calcAlgContext);
226
227
228 bool testSubsumerCandidatePossibleWithMergedSaturatedModel(CIndividualProcessNode* indiNode, CConcept* equivConcept, CCalculationAlgorithmContext* calcAlgContext);
229
230 bool testSubsumerCandidatePossibleWithMergedSaturatedModel(CIndividualProcessNode* indiNode, CConcept* testConcept, bool negation, bool& mergeSatisfieableFlag, CCalculationAlgorithmContext* calcAlgContext);
231 bool testConceptSetWithSaturatedModelMergable(CIndividualProcessNode* indiNode, CIndividualSaturationProcessNode* saturationIndiNode, bool& mergeClashedFlag, CCalculationAlgorithmContext* calcAlgContext);
232 bool testRoleSuccessorsWithSaturatedModelMergable(CIndividualProcessNode* indiNode, CIndividualSaturationProcessNode* saturationIndiNode, CCalculationAlgorithmContext* calcAlgContext);
233 bool testSaturatedExistentialsModelMergable(CIndividualProcessNode* indiNode, CIndividualSaturationProcessNode* saturationIndiNode, CCalculationAlgorithmContext* calcAlgContext);
234
235
236 bool collectSuccessorMergingNodesAndConcepts(CIndividualProcessNode* indiNode, CIndividualSaturationProcessNode* saturationIndiNode, CReapplyRoleSuccessorHash* roleSuccHash, CRole* role, CPROCESSINGLIST<CIndividualSaturationProcessNode*>& successorList, CPROCESSINGLIST<TConceptNegationPair>& trivialSuccessorPropagatedConceptList, CPROCESSINGSET<CRole*>& backwardRoleSet, CCalculationAlgorithmContext* calcAlgContext);
237 bool collectSuccessorMergingNodesAndConcepts(CIndividualSaturationProcessNode* excludeSaturationIndiNode, CRole* role, CPROCESSINGLIST<CIndividualSaturationProcessNode*>& successorList, CPROCESSINGLIST<TConceptNegationPair>& trivialSuccessorPropagatedConceptList, CPROCESSINGSET<CRole*>& backwardRoleSet, CPROCESSINGLIST<CIndividualSaturationProcessNode*>& nextSuccessorList, CPROCESSINGLIST<TConceptNegationPair>& nextTrivialSuccessorPropagatedConceptList, CPROCESSINGSET<CRole*>& nextBackwardRoleSet, CPROCESSINGHASH<CRole*,TConceptNegationPair>& successorInfluenceConceptsHash, CCalculationAlgorithmContext* calcAlgContext);
238
239
240 bool collectEquivalenceConceptAlternatives(CIndividualProcessNode* indiNode, CConcept* testConcept, bool testConceptNegation, CPROCESSINGSET< QPair<CConcept*,bool> >& alternativesSet, CPROCESSINGHASH< QPair<CConcept*,bool>,CSaturatedMergedTestItem >* testSaturatedMergedHash, bool& oneMergeSatisfieableFlag, bool& allMergeUnsatisfieableFlag, CCalculationAlgorithmContext* calcAlgContext);
241 bool testEquivalenceConceptAlternatives(CIndividualProcessNode* indiNode, CPROCESSINGSET< QPair<CConcept*,bool> >& alternativesSet, CPROCESSINGHASH< QPair<CConcept*,bool>,CSaturatedMergedTestItem >* testSaturatedMergedHash, bool& oneMergeSatisfieableFlag, bool& allMergeUnsatisfieableFlag, CCalculationAlgorithmContext* calcAlgContext);
242
243 CIndividualSaturationProcessNode* getSaturatedIndividualNodeForConcept(CConcept* concept, bool conceptNegation, CCalculationAlgorithmContext* calcAlgContext);
244 CIndividualSaturationProcessNode* getExistentialSaturatedIndividualNodeForConcept(CConcept* concept, CCalculationAlgorithmContext* calcAlgContext);
245
246 bool testSaturatedSuccessorModelMergable(CIndividualSaturationProcessNode* existentialIndiNode, CPROCESSINGLIST<CIndividualSaturationProcessNode*>& successorList, CPROCESSINGLIST<TConceptNegationPair>* trivialSuccessorPropagatedConceptList, CPROCESSINGSET<CRole*>& backwardRoleSet, cint64 remainingMergingDepth, cint64& remainingMergingCount, CCalculationAlgorithmContext* calcAlgContext);
247 bool testSingleSaturatedSuccessorModelMergable(CIndividualSaturationProcessNode* existentialIndiNode, CPROCESSINGLIST<CIndividualSaturationProcessNode*>& successorList, CPROCESSINGLIST<TConceptNegationPair>* trivialSuccessorPropagatedConceptList, CPROCESSINGSET<CRole*>& backwardRoleSet, cint64 remainingMergingDepth, cint64& remainingMergingCount, CCalculationAlgorithmContext* calcAlgContext);
248 bool testMultipleSaturatedSuccessorModelMergable(CIndividualSaturationProcessNode* existentialIndiNode, CPROCESSINGLIST<CIndividualSaturationProcessNode*>& successorList, CPROCESSINGLIST<TConceptNegationPair>* trivialSuccessorPropagatedConceptList, CPROCESSINGSET<CRole*>& backwardRoleSet, cint64 remainingMergingDepth, cint64& remainingMergingCount, CCalculationAlgorithmContext* calcAlgContext);
249
250
251
252
253 bool addAutomateTransactionConcepts(CConcept* concept, bool negation, CRole* role, CPROCESSINGLIST<CIndividualSaturationProcessNode*>& successorList, CPROCESSINGLIST<TConceptNegationPair>& trivialConceptTestingList, CCalculationAlgorithmContext* calcAlgContext);
254 bool collectTrivialPropagationTestingConcepts(CConcept* concept, bool negation, CPROCESSINGLIST<TConceptNegationPair>& trivialConceptTestingList, CCalculationAlgorithmContext* calcAlgContext);
255
256
257 // private variables
258 private:
259
260 };
261
262 }; // end namespace Algorithm
263
264 }; // end namespace Kernel
265
266 }; // end namespace Reasoner
267
268 }; // end namespace Konclude
269
270 #endif // KONCLUDE_REASONER_KERNEL_ALGORITHM_CSATISFIABLETASKCLASSIFICATIONMESSAGEANALYSER_H