Debian Codegraph @

Source/Reasoner/Consistiser/CTotallyPrecomputationThread.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_CONSISTISER_CTOTALLYPRECOMPUTATIONTHREAD_H
22 #define KONCLUDE_REASONER_CONSISTISER_CTOTALLYPRECOMPUTATIONTHREAD_H
23
24 // Libraries includes
25 #include <QStack>
26 #include <QListIterator>
27
28
29 // Namespace includes
30 #include "ConsistiserSettings.h"
31 #include "CPrecomputationThread.h"
32 #include "CPrecomputationTestingItem.h"
33 #include "CConsistencePrecomputationTestingItem.h"
34 #include "CConceptCyclePrecomputationTestingItem.h"
35 #include "CSaturationPrecomputationTestingItem.h"
36 #include "CTotallyOntologyPrecomputationItem.h"
37 #include "CSaturationCommonDisjunctConceptsExtractor.h"
38 #include "CIndividualPrecomputationTestingItem.h"
39
40 // Other includes
41 #include "Reasoner/Kernel/Manager/CReasonerManager.h"
42
43 #include "Reasoner/Kernel/Cache/CReuseCompletionGraphCacheWriter.h"
44 #include "Reasoner/Kernel/Cache/CReuseCompletionGraphCacheEntryExpandWriteData.h"
45 #include "Reasoner/Kernel/Cache/CBackendRepresentativeMemoryCache.h"
46
47 #include "Reasoner/Kernel/Task/CCalculationConfigurationExtension.h"
48 #include "Reasoner/Kernel/Task/CSaturationOccurrenceStatisticsCollectingAdapter.h"
49 #include "Reasoner/Kernel/Task/CConsistenceTaskData.h"
50
51 #include "Reasoner/Generator/CSatisfiableCalculationJobGenerator.h"
52 #include "Reasoner/Generator/CApproximatedSaturationCalculationJobGenerator.h"
53
54 #include "Utilities/Memory/CTempMemoryPoolContainerAllocationManager.h"
55
56 // Logger includes
57 #include "Logger/CLogger.h"
58 #include "Logger/CLogIdentifier.h"
59
60
61 namespace Konclude {
62
63 using namespace Utilities::Memory;
64
65 namespace Reasoner {
66
67 using namespace Kernel::Task;
68 using namespace Kernel::Manager;
69 using namespace Kernel::Cache;
70 using namespace Generator;
71
72 namespace Consistiser {
73
74 //#define KONCLUDE_DEBUG_PRECOMPUTATION_SCHEDULING_LOGS
75
76 using namespace Events;
77
78 class CConceptNegationSaturationItem : public QPair<CSaturationConceptDataItem*,QPair<CConcept*,bool> > {
79 public:
80 CConceptNegationSaturationItem(CConcept* concept, bool negation, CSaturationConceptDataItem* ontConSatDataItem) : QPair<CSaturationConceptDataItem*,QPair<CConcept*,bool> >(ontConSatDataItem,QPair<CConcept*,bool>(concept,negation)) {
81 }
82 CSaturationConceptDataItem* getSaturationConceptDataItem() {
83 return first;
84 }
85 CConcept* getConcept() {
86 return second.first;
87 }
88 bool getNegation() {
89 return second.second;
90 }
91 };
92
93
94 class CSaturationSaturationListItem {
95 public:
96 CSaturationSaturationListItem() {
97 mSubsumerOrdered = false;
98 mLastSubsumerSaturationItem = nullptr;
99 mSaturationItem = nullptr;
100 }
101 CSaturationSaturationListItem(CSaturationConceptDataItem* saturationItem) : mSaturationItem(saturationItem) {
102 mSubsumerOrdered = false;
103 mLastSubsumerSaturationItem = nullptr;
104 }
105 CSaturationConceptDataItem* mSaturationItem;
106 CSaturationConceptDataItem* mLastSubsumerSaturationItem;
107 QList<CSaturationConceptDataItem*> mSaturationItemList;
108 bool mSubsumerOrdered;
109 };
110
111
112
113 class CTriplesAssertedConceptsExtendingSetVisitor : public COntologyTriplesAssertedTypesVisitor {
114 public:
115 CTriplesAssertedConceptsExtendingSetVisitor(QSet<TConceptNegPair>* extendingTypeSet) {
116 mExtendingTypeSet = extendingTypeSet;
117 }
118
119 bool visitAssertedConcept(CConcept* concept, COntologyTriplesAssertionsAccessor* accessor) {
120 mExtendingTypeSet->insert(TConceptNegPair(concept, false));
121 return true;
122 }
123
124 bool visitAssertedObjectRole(CRole* role, COntologyTriplesAssertionsAccessor* accessor) {
125 return false;
126 }
127
128 bool visitAssertedDataRole(CRole* role, COntologyTriplesAssertionsAccessor* accessor) {
129 return false;
130 }
131
132
133 QSet<TConceptNegPair>* mExtendingTypeSet;
134 };
135
136
137 class CTriplesAssertedRolesExtendingSetVisitor : public COntologyTriplesAssertedTypesVisitor {
138 public:
139 CTriplesAssertedRolesExtendingSetVisitor(QSet<CRole*>* extendingTypeSet) {
140 mExtendingTypeSet = extendingTypeSet;
141 }
142
143 bool visitAssertedConcept(CConcept* concept, COntologyTriplesAssertionsAccessor* accessor) {
144 return false;
145 }
146
147 bool visitAssertedObjectRole(CRole* role, COntologyTriplesAssertionsAccessor* accessor) {
148 mExtendingTypeSet->insert(role);
149 return true;
150 }
151
152 bool visitAssertedDataRole(CRole* role, COntologyTriplesAssertionsAccessor* accessor) {
153 mExtendingTypeSet->insert(role);
154 return true;
155 }
156
157
158 QSet<CRole*>* mExtendingTypeSet;
159 };
160
161
162
163
164 /*!
165 *
166 * \class CTotallyPrecomputationThread
167 * \author Andreas Steigmiller
168 * \version 0.1
169 * \brief TODO
170 *
171 */
172 class CTotallyPrecomputationThread : public CPrecomputationThread, public CLogIdentifier {
173 // public methods
174 public:
175 //! Constructor
176 CTotallyPrecomputationThread(CReasonerManager* reasonerManager);
177
178 //! Destructor
179 virtual ~CTotallyPrecomputationThread();
180
181
182 // protected methods
183 protected:
184 virtual COntologyPrecomputationItem* initializeOntologyPrecomputionItem(CConcreteOntology* ontology, CConfigurationBase* config);
185
186 virtual bool createNextTest();
187
188 virtual bool finishOntologyPrecomputation(CTotallyOntologyPrecomputationItem* totallyPreCompItem);
189 virtual bool precomputationTested(COntologyPrecomputationItem* ontPreCompItem, CPrecomputationTestingItem* preTestItem, CPrecomputationCalculatedCallbackEvent* pcce);
190 virtual bool precomputationTested(COntologyPrecomputationItem* ontPreCompItem, CPrecomputationTestingItem* preTestItem, CSaturationPrecomputationCalculatedCallbackEvent* pcce);
191
192 void synchronouslyRetrieveIndividualsPrecomputation(CTotallyOntologyPrecomputationItem* totallyPreCompItem, COntologyPrecomputationItem* ontPreCompItem);
193
194 virtual bool precomputationIndividualsRetrieved(COntologyPrecomputationItem* ontPreCompItem, CRetrievedPrecomputationIndividualsCallbackEvent* pcce);
195 virtual bool precomputationIndividualsRetrieved(COntologyPrecomputationItem* ontPreCompItem, bool directly);
196 bool decrementUsageFromIndividualPrecomputationCoordinationHash(CIndividualPrecomputationCoordinationHash* indiPrecompCoordHash, CTotallyOntologyPrecomputationItem* totallyPreCompItem);
197 bool requestIndividualsPrecomputationRetrieval(CTotallyOntologyPrecomputationItem* totallyPreCompItem, bool allIndividualsSaturated);
198 bool retrieveIndividualsPrecomputation(CTotallyOntologyPrecomputationItem* totallyPreCompItem);
199
200
201 bool createIndividualPrecomputationCheck(CTotallyOntologyPrecomputationItem* totallyPreCompItem);
202 bool createConsistencePrecomputationCheck(CTotallyOntologyPrecomputationItem* totallyPreCompItem);
203 bool createConceptCyclePrecomputation(CConceptCycleData* conceptCycleData, CTotallyOntologyPrecomputationItem* totallyPreCompItem);
204
205 bool determineMinimumNextConceptID(CConsistence* consistence, COntologyPrecomputationItem* ontPreCompItem);
206
207
208 void createSaturationConstructionJob(CTotallyOntologyPrecomputationItem* totallyPreCompItem);
209 bool hasRoleRanges(CTotallyOntologyPrecomputationItem* totallyPreCompItem, CRole* role);
210 void orderItemsSaturationTesting(CTotallyOntologyPrecomputationItem* totallyPreCompItem, CSaturationConceptDataItem* ontConSatDataItem, QList<CSaturationConceptDataItem*>& orderedItemList, QStack<CSaturationSaturationListItem>& saturationItemStack);
211 void analyseConceptSaturationSubsumerExistItems(CTotallyOntologyPrecomputationItem* totallyPreCompItem, QList<CConceptNegationSaturationItem>& processList);
212 void propagateSubsumerItemFlag(CSaturationConceptDataItem* ontClassSatTestItem);
213 void propagateExistInitializationFlag(CSaturationConceptDataItem* ontConSatDataItem);
214
215 void extendDisjunctionsCandidateAlternativesItems(CTotallyOntologyPrecomputationItem* totallyPreCompItem, CSaturationConceptDataItem* ontConSatDataItem, QList<CSaturationConceptDataItem*>* newDisjunctionCandidateAlternativeList);
216 CConcept* getDisjunctCheckingConcept(CConcept* opConcept, bool opConNegation, bool* checkingNegation);
217
218 bool isAllAssertionIndividualSaturationSufficient(CTotallyOntologyPrecomputationItem* totallyPreCompItem);
219
220
221 void createOccurrenceStatisticsCollectingSaturationProcessingJob(CTotallyOntologyPrecomputationItem* totallyPreCompItem);
222
223 void createMarkedConceptSaturationProcessingJob(CTotallyOntologyPrecomputationItem* totallyPreCompItem, bool allowAllSaturation);
224 void createIndividualSaturationProcessingJob(CTotallyOntologyPrecomputationItem* totallyPreCompItem, const QList<CIndividual*>& individualList);
225 void createTripleIndexedIndividualsSaturationProcessingJob(CTotallyOntologyPrecomputationItem* totallyPreCompItem, cint64 startIndiId, cint64 endIndiId);
226
227 bool saturateRemainingRequiredItems(CTotallyOntologyPrecomputationItem* totallyPreCompItem);
228 cint64 markSaturationProcessingItems(CTotallyOntologyPrecomputationItem* totallyPreCompItem, CSaturationConceptDataItem* startMarkingItem, CConcept* startMarkingConcept, bool startMarkingConceptNegation);
229 bool saturateRemainingConsistencyRequiredConcepts(CTotallyOntologyPrecomputationItem* totallyPreCompItem);
230 bool saturateRemainingRequiredSaturationIndividuals(CTotallyOntologyPrecomputationItem* totallyPreCompItem);
231 bool addIdentifiedRemainingConsistencyRequiredConcepts(CTotallyOntologyPrecomputationItem* totallyPreCompItem);
232
233 bool addRequiredSaturationIndividuals(CTotallyOntologyPrecomputationItem* totallyPreCompItem);
234
235
236 void extractCommonDisjunctConceptsFromPrecomputedSaturation(CTotallyOntologyPrecomputationItem* totallyPreCompItem);
237 void logSaturationInfos(CTotallyOntologyPrecomputationItem* totallyPreCompItem);
238
239
240 QList<CIndividualReference> getIndividualComputationList(CTotallyOntologyPrecomputationItem* totallyPreCompItem);
241 QList<CIndividualReference> getNextIndividualComputationPartList(CTotallyOntologyPrecomputationItem* totallyPreCompItem);
242
243
244
245 // protected variables
246 protected:
247 CReuseCompletionGraphCacheWriter* mReuseCompletionGraphCacheWriter;
248 CBackendRepresentativeMemoryCache* mBackendAssocCache;
249
250 bool mConfForceFullCompletionGraphConstruction;
251 bool mConfConditionalFullCompletionGraphConstruction;
252
253 cint64 mConfFullCGCExclusionConditionMaximumIndividualLimit;
254 cint64 mConfFullCGCSuggestionConditionMaximumIndividualLimit;
255
256 double mConfFullCGCExclusionConditionMaximumIndividualConceptRatio;
257 double mConfFullCGCSuggestionConditionMaximumIndividualConceptRatio;
258
259
260 double mConfPrecomputationIndividualsRetrievalWhileSaturation;
261
262
263 // private methods
264 private:
265
266 // private variables
267 private:
268
269 };
270
271 }; // end namespace Consistiser
272
273 }; // end namespace Reasoner
274
275 }; // end namespace Konclude
276
277 #endif // KONCLUDE_REASONER_CONSISTISER_CTOTALLYPRECOMPUTATIONTHREAD_H