| 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_ANSWERER_COPTIMIZEDCOMPLEXCONCEPTITEM_H |
| 22 |
#define KONCLUDE_REASONER_ANSWERER_COPTIMIZEDCOMPLEXCONCEPTITEM_H |
| 23 |
|
| 24 |
// Libraries includes |
| 25 |
|
| 26 |
|
| 27 |
// Namespace includes |
| 28 |
#include "AnswererSettings.h" |
| 29 |
#include "CComplexConceptItemComputationProcess.h" |
| 30 |
#include "CRequirementWaitingDependencyData.h" |
| 31 |
#include "COptimizedComplexConceptInstanziatedIndividualItemHash.h" |
| 32 |
#include "CCacheAnswersWeightedUsageCostItem.h" |
| 33 |
|
| 34 |
|
| 35 |
|
| 36 |
// Other includes |
| 37 |
#include "Reasoner/Ontology/CConcept.h" |
| 38 |
#include "Reasoner/Ontology/OntologySettings.h" |
| 39 |
#include "Reasoner/Ontology/CConceptProcessData.h" |
| 40 |
|
| 41 |
#include "Reasoner/Taxonomy/CHierarchyNode.h" |
| 42 |
#include "Reasoner/Realization/CConceptInstanceItem.h" |
| 43 |
|
| 44 |
#include "Parser/Expressions/CClassTermExpression.h" |
| 45 |
|
| 46 |
#include "Reasoner/Realization/CRealizationIndividualInstanceItemReference.h" |
| 47 |
|
| 48 |
|
| 49 |
// Logger includes |
| 50 |
#include "Logger/CLogger.h" |
| 51 |
|
| 52 |
|
| 53 |
namespace Konclude { |
| 54 |
|
| 55 |
using namespace Parser::Expression; |
| 56 |
|
| 57 |
namespace Reasoner { |
| 58 |
|
| 59 |
using namespace Ontology; |
| 60 |
using namespace Taxonomy; |
| 61 |
using namespace Realization; |
| 62 |
|
| 63 |
namespace Answerer { |
| 64 |
|
| 65 |
|
| 66 |
/*! |
| 67 |
* |
| 68 |
* \class COptimizedComplexConceptItem |
| 69 |
* \author Andreas Steigmiller |
| 70 |
* \version 0.1 |
| 71 |
* \brief TODO |
| 72 |
* |
| 73 |
*/ |
| 74 |
class COptimizedComplexConceptItem : public CCacheAnswersWeightedUsageCostItem { |
| 75 |
// public methods |
| 76 |
public: |
| 77 |
//! Constructor |
| 78 |
COptimizedComplexConceptItem(); |
| 79 |
~COptimizedComplexConceptItem(); |
| 80 |
|
| 81 |
|
| 82 |
|
| 83 |
COptimizedComplexConceptItem* initComplexConcept(CConcept* concept, bool negated); |
| 84 |
|
| 85 |
bool getConceptNegation(); |
| 86 |
CConcept* getConcept(); |
| 87 |
|
| 88 |
bool representsConceptClass(); |
| 89 |
TConceptNegPair getConceptNegationPair(); |
| 90 |
|
| 91 |
|
| 92 |
CConcept* getCandidateConcept(); |
| 93 |
CConcept* getMarkerConcept(); |
| 94 |
CConcept* getPropagationConcept(); |
| 95 |
|
| 96 |
COptimizedComplexConceptItem* setCandidateConcept(CConcept* concept); |
| 97 |
COptimizedComplexConceptItem* setMarkerConcept(CConcept* concept); |
| 98 |
COptimizedComplexConceptItem* setPropagationConcept(CConcept* concept); |
| 99 |
|
| 100 |
COptimizedComplexConceptItem* setCompletelyHandledReducedInstanceTestingConcept(CConcept* concept); |
| 101 |
CConcept* getCompletelyHandledReducedInstanceTestingConcept(); |
| 102 |
COptimizedComplexConceptItem* setCompletelyHandledReducedInstanceTestingConceptNegation(bool negation); |
| 103 |
bool getCompletelyHandledReducedInstanceTestingConceptNegation(); |
| 104 |
|
| 105 |
|
| 106 |
COptimizedComplexConceptItem* setAllAtomicConceptsCompletelyHandled(bool completelyHandled); |
| 107 |
bool getAllAtomicConceptsCompletelyHandled(); |
| 108 |
|
| 109 |
|
| 110 |
|
| 111 |
CClassTermExpression* getClassTermExpression(); |
| 112 |
COptimizedComplexConceptItem* setClassTermExpression(CClassTermExpression* classExpression); |
| 113 |
|
| 114 |
|
| 115 |
CComplexConceptItemComputationProcess* getComputationProcess(); |
| 116 |
|
| 117 |
bool isSatisfiable(); |
| 118 |
COptimizedComplexConceptItem* setSatisfiability(bool satisfiable); |
| 119 |
|
| 120 |
bool isSuperClassComputationInitializing(); |
| 121 |
COptimizedComplexConceptItem* setSuperClassComputationInitializing(bool initialized); |
| 122 |
|
| 123 |
|
| 124 |
COptimizedComplexConceptItem* setPossibleSuperClassNodeTestingList(QList<CHierarchyNode*>* classNodeList); |
| 125 |
QList<CHierarchyNode*>* getPossibleSuperClassNodeTestingList(); |
| 126 |
|
| 127 |
|
| 128 |
COptimizedComplexConceptItem* setKnownSuperClassNodeSet(QSet<CHierarchyNode*>* directClassNodeSet); |
| 129 |
COptimizedComplexConceptItem* setPossibleSuperClassNodeSet(QSet<CHierarchyNode*>* directClassNodeSet); |
| 130 |
COptimizedComplexConceptItem* setDirectSuperClassNodeSet(QSet<CHierarchyNode*>* directClassNodeSet); |
| 131 |
|
| 132 |
|
| 133 |
QSet<CHierarchyNode*>* getKnownSuperClassNodeSet(); |
| 134 |
QSet<CHierarchyNode*>* getPossibleSuperClassNodeSet(); |
| 135 |
QSet<CHierarchyNode*>* getDirectSuperClassNodeSet(); |
| 136 |
|
| 137 |
|
| 138 |
COptimizedComplexConceptItem* setPossibleSubClassTestingNodeSet(QSet<CHierarchyNode*>* directClassNodeSet); |
| 139 |
COptimizedComplexConceptItem* setDirectSubClassNodeSet(QSet<CHierarchyNode*>* directClassNodeSet); |
| 140 |
|
| 141 |
|
| 142 |
QSet<CHierarchyNode*>* getPossibleSubClassTestingNodeSet(); |
| 143 |
QSet<CHierarchyNode*>* getDirectSubClassNodeSet(); |
| 144 |
|
| 145 |
|
| 146 |
|
| 147 |
COptimizedComplexConceptItem* setPossibleSubClassNodeTestingList(QList<CHierarchyNode*>* classNodeList); |
| 148 |
QList<CHierarchyNode*>* getPossibleSubClassNodeTestingList(); |
| 149 |
|
| 150 |
|
| 151 |
QSet<CConcept*>* getKnownSuperConceptSet(); |
| 152 |
QSet<CConcept*>* getPossibleSuperConceptSet(); |
| 153 |
COptimizedComplexConceptItem* setKnownSuperConceptSet(QSet<CConcept*>* conceptSet); |
| 154 |
COptimizedComplexConceptItem* setPossibleSuperConceptSet(QSet<CConcept*>* conceptSet); |
| 155 |
|
| 156 |
|
| 157 |
bool hasQueuedProcessStep(); |
| 158 |
CComplexConceptStepComputationProcess* setQueuedProcessStep(); |
| 159 |
COptimizedComplexConceptItem* setQueuedProcessStep(CComplexConceptStepComputationProcess* queuedProcessStep); |
| 160 |
|
| 161 |
|
| 162 |
QSet<COptimizedComplexConceptItem*>* getSuperComplexConceptItemSet(); |
| 163 |
bool hasSuperComplexConceptItem(COptimizedComplexConceptItem* item); |
| 164 |
QSet<COptimizedComplexConceptItem*>* getSubComplexConceptItemSet(); |
| 165 |
bool hasSubComplexConceptItem(COptimizedComplexConceptItem* item); |
| 166 |
|
| 167 |
QSet<CIndividualReference>* getInstancesItemSet(); |
| 168 |
|
| 169 |
QSet<TConceptNegPair>* getAtomicConcpetSet(); |
| 170 |
|
| 171 |
|
| 172 |
|
| 173 |
|
| 174 |
|
| 175 |
QSet<CIndividualReference>* getPossibleInstanceIndividualSet(); |
| 176 |
QSet<CIndividualReference>* getKnownInstanceIndividualSet(); |
| 177 |
|
| 178 |
|
| 179 |
COptimizedComplexConceptItem* setPossibleInstanceIndividualSet(QSet<CIndividualReference>* instanceSet); |
| 180 |
COptimizedComplexConceptItem* setKnownInstanceIndividualSet(QSet<CIndividualReference>* instanceSet); |
| 181 |
|
| 182 |
QSet<CRealizationIndividualInstanceItemReference>* getPossibleInstanceItemSet(); |
| 183 |
QSet<CRealizationIndividualInstanceItemReference>::const_iterator getPossibleInstanceItemSetCandidatePropagationIterator(); |
| 184 |
COptimizedComplexConceptItem* setPossibleInstanceItemSetCandidatePropagationIterator(QSet<CRealizationIndividualInstanceItemReference>::const_iterator it); |
| 185 |
|
| 186 |
QSet<CRealizationIndividualInstanceItemReference>* getPossibleInstanceCandidatePropagationItemSet(); |
| 187 |
COptimizedComplexConceptItem* setPossibleInstanceCandidatePropagationItemSet(QSet<CRealizationIndividualInstanceItemReference>* set); |
| 188 |
|
| 189 |
|
| 190 |
bool hasPossibleInstanceItemSetCandidatePropagationIteratorInitialized(); |
| 191 |
COptimizedComplexConceptItem* setPossibleInstanceItemSetCandidatePropagationIteratorInitialized(bool initialized); |
| 192 |
|
| 193 |
cint64 getPossibleInstanceCandidatePropagationBeginningKnownInstancesCount(); |
| 194 |
COptimizedComplexConceptItem* setPossibleInstanceCandidatePropagationBeginningKnownInstancesCount(cint64 count); |
| 195 |
|
| 196 |
|
| 197 |
COptimizedComplexConceptInstanziatedIndividualItemHash* getKnownInstanceItems(); |
| 198 |
|
| 199 |
COptimizedComplexConceptItem* setPossibleInstanceItemSet(QSet<CRealizationIndividualInstanceItemReference>* instanceSet); |
| 200 |
COptimizedComplexConceptItem* setKnownInstanceItems(COptimizedComplexConceptInstanziatedIndividualItemHash* instanceItems); |
| 201 |
|
| 202 |
|
| 203 |
cint64 getPossibleTestedNonInstanceCount(); |
| 204 |
COptimizedComplexConceptItem* incPossibleTestedNonInstanceCount(cint64 incCount = 1); |
| 205 |
|
| 206 |
cint64 getRealizationRetrievedInstanceCandidateCount(); |
| 207 |
COptimizedComplexConceptItem* inRealizationRetrievedInstanceCandidateCount(cint64 incCount = 1); |
| 208 |
|
| 209 |
|
| 210 |
cint64 getRealizationRetrievingExpectedInstanceCandidateCount(); |
| 211 |
COptimizedComplexConceptItem* setRealizationRetrievingExpectedInstanceCandidateCount(cint64 count); |
| 212 |
|
| 213 |
|
| 214 |
|
| 215 |
double getRealizationIteratorSamplingExpectedCount(); |
| 216 |
COptimizedComplexConceptItem* setRealizationIteratorSamplingExpectedCount(double expectedCount); |
| 217 |
|
| 218 |
|
| 219 |
|
| 220 |
|
| 221 |
COptimizedComplexConceptItem* setMaximumSubClassNodeSet(QSet<CHierarchyNode*>* maxSubClassNodeSet); |
| 222 |
|
| 223 |
|
| 224 |
QSet<CHierarchyNode*>* getMaximumSubClassNodeSet(); |
| 225 |
|
| 226 |
|
| 227 |
bool isLazyRealizationInitializationRequested(); |
| 228 |
COptimizedComplexConceptItem* setLazyRealizationInitializationRequested(bool requested); |
| 229 |
|
| 230 |
|
| 231 |
|
| 232 |
cint64 getLastRetrievedCertainInstanceItemCount(); |
| 233 |
COptimizedComplexConceptItem* setLastRetrievedCertainInstanceItemCount(cint64 certainCount); |
| 234 |
|
| 235 |
double getMinimalRetrievingInstanceItemSize(); |
| 236 |
COptimizedComplexConceptItem* setMinimalRetrievingInstanceItemSize(double newSize); |
| 237 |
|
| 238 |
|
| 239 |
bool isLazyRealizationInitialized(); |
| 240 |
COptimizedComplexConceptItem* setLazyRealizationInitialized(bool requested); |
| 241 |
bool isLazyNeighbourRealizationPruningRequired(); |
| 242 |
COptimizedComplexConceptItem* setLazyNeighbourRealizationPruningRequired(bool requested); |
| 243 |
bool isLazyNeighbourRealizationRequested(); |
| 244 |
COptimizedComplexConceptItem* setLazyNeighbourRealizationRequested(bool requested); |
| 245 |
|
| 246 |
bool isLazyRealizationInstancesRetrieved(); |
| 247 |
COptimizedComplexConceptItem* setLazyRealizationInstancesRetrieved(bool requested); |
| 248 |
|
| 249 |
bool isLazyRealizationProcessing(); |
| 250 |
cint64 getLazyRealizationProcessingCount(); |
| 251 |
COptimizedComplexConceptItem* incLazyRealizationProcessingCount(cint64 incCount = 1); |
| 252 |
COptimizedComplexConceptItem* decLazyRealizationProcessingCount(cint64 decCount = 1); |
| 253 |
|
| 254 |
COptimizedComplexConceptItem* setCompletelyHandledChecked(bool requested); |
| 255 |
bool isCompletelyHandledChecked(); |
| 256 |
|
| 257 |
|
| 258 |
|
| 259 |
|
| 260 |
COptimizedComplexConceptItem* setConceptAbsorbed(bool absorbed); |
| 261 |
bool isConceptAbsorbed(); |
| 262 |
|
| 263 |
COptimizedComplexConceptItem* setCandidatePropagated(bool hasCandidate); |
| 264 |
bool isCandidatePropagated(); |
| 265 |
|
| 266 |
COptimizedComplexConceptItem* setCandidateReceived(bool hasCandidate); |
| 267 |
bool isCandidateReceived(); |
| 268 |
|
| 269 |
bool isCandidatePropagationProcessing(); |
| 270 |
cint64 getCandidatePropagationProcessingCount(); |
| 271 |
COptimizedComplexConceptItem* incCandidatePropagationProcessingCount(cint64 incCount = 1); |
| 272 |
COptimizedComplexConceptItem* decCandidatePropagationProcessingCount(cint64 decCount = 1); |
| 273 |
|
| 274 |
|
| 275 |
|
| 276 |
|
| 277 |
|
| 278 |
COptimizedComplexVariableConceptBaseItem* getVariableConceptBaseItem(); |
| 279 |
COptimizedComplexConceptItem* setVariableConceptBaseItem(COptimizedComplexVariableConceptBaseItem* baseItem); |
| 280 |
|
| 281 |
COptimizedComplexVariableConceptSubSuperItem* getVariableConceptSuperClassesItem(); |
| 282 |
COptimizedComplexConceptItem* setVariableConceptSuperClassesItem(COptimizedComplexVariableConceptSubSuperItem* superItem); |
| 283 |
|
| 284 |
COptimizedComplexVariableConceptSubSuperItem* getVariableConceptSubClassesItem(); |
| 285 |
COptimizedComplexConceptItem* setVariableConceptSubClassesItem(COptimizedComplexVariableConceptSubSuperItem* superItem); |
| 286 |
|
| 287 |
|
| 288 |
COptimizedComplexVariableConceptSubSuperItem* getVariableConceptSuperSubClassesItem(bool superClasses); |
| 289 |
COptimizedComplexConceptItem* setVariableConceptSuperSubClassesItem(COptimizedComplexVariableConceptSubSuperItem* item, bool superClasses); |
| 290 |
|
| 291 |
|
| 292 |
|
| 293 |
bool isTopObjectPropertyUsed(); |
| 294 |
COptimizedComplexConceptItem* setTopObjectPropertyUsage(bool topObjectPropertyUsed); |
| 295 |
|
| 296 |
|
| 297 |
CRealizationIndividualInstanceItemReferenceIterator* getRealizationIterator(); |
| 298 |
COptimizedComplexConceptItem* setRealizationIterator(CRealizationIndividualInstanceItemReferenceIterator* realizationIterator); |
| 299 |
|
| 300 |
|
| 301 |
CRequirementWaitingDependencyData* getInstancesComputationRequirements(); |
| 302 |
|
| 303 |
|
| 304 |
cint64 getConceptItemId(); |
| 305 |
COptimizedComplexConceptItem* setConceptItemId(cint64 id); |
| 306 |
|
| 307 |
|
| 308 |
#ifdef OPTIMIZED_ANSWERER_DEBUG_STRINGS |
| 309 |
QStringList debugVariableNameUseList; |
| 310 |
#endif |
| 311 |
|
| 312 |
|
| 313 |
virtual bool clearComputation(); |
| 314 |
|
| 315 |
|
| 316 |
cint64 getMemoryConsumption(); |
| 317 |
|
| 318 |
|
| 319 |
|
| 320 |
cint64 getLastConceptInstancesCacheReportedCount(); |
| 321 |
cint64 getLastConceptInstancesCacheReportedSize(); |
| 322 |
|
| 323 |
COptimizedComplexConceptItem* setLastConceptInstancesCacheReportedCount(cint64 count); |
| 324 |
COptimizedComplexConceptItem* setLastConceptInstancesCacheReportedSize(cint64 size); |
| 325 |
|
| 326 |
|
| 327 |
// protected methods |
| 328 |
protected: |
| 329 |
|
| 330 |
// protected variables |
| 331 |
protected: |
| 332 |
cint64 mConceptItemId; |
| 333 |
|
| 334 |
CConcept* mConcept; |
| 335 |
bool mConceptNegation; |
| 336 |
CConcept* mCandidateConcept; |
| 337 |
CConcept* mMarkerConcept; |
| 338 |
CConcept* mPropagationConcept; |
| 339 |
|
| 340 |
CConcept* mCompletelyHandledReducedInstanceTestingConcept; |
| 341 |
bool mCompletelyHandledReducedInstanceTestingConceptNegation; |
| 342 |
bool mAllAtomicConceptsCompletelyHandled; |
| 343 |
|
| 344 |
CClassTermExpression* mClassTermExpression; |
| 345 |
|
| 346 |
CComplexConceptStepComputationProcess* mQueuedProcessStep; |
| 347 |
|
| 348 |
bool mSatisfiable; |
| 349 |
bool mSuperClassComputationInitializing; |
| 350 |
|
| 351 |
CHierarchyNode* mKnownEquivalentClassNode; |
| 352 |
|
| 353 |
QSet<CHierarchyNode*>* mDirectSuperClassNodeSet; |
| 354 |
QSet<CHierarchyNode*>* mKnownSuperClassNodeSet; |
| 355 |
QSet<CHierarchyNode*>* mPossibleSuperClassNodeSet; |
| 356 |
QList<CHierarchyNode*>* mPossibleSuperClassNodeTestingList; |
| 357 |
QSet<CConcept*>* mKnownSuperConceptSet; |
| 358 |
QSet<CConcept*>* mPossibleSuperConceptSet; |
| 359 |
|
| 360 |
QSet<CHierarchyNode*>* mDirectSubClassNodeSet; |
| 361 |
QSet<CHierarchyNode*>* mPossibleSubClassTestingNodeSet; |
| 362 |
QList<CHierarchyNode*>* mPossibleSubClassNodeTestingList; |
| 363 |
QSet<CHierarchyNode*>* mMaximumSubClassNodeSet; |
| 364 |
|
| 365 |
|
| 366 |
QSet<TConceptNegPair> mAtomicClassConceptSet; |
| 367 |
|
| 368 |
QSet<COptimizedComplexConceptItem*> mSuperComplexConceptItemSet; |
| 369 |
QSet<COptimizedComplexConceptItem*> mSubComplexConceptItemSet; |
| 370 |
|
| 371 |
|
| 372 |
QSet<CIndividualReference>* mKnownInstanceSet; |
| 373 |
QSet<CIndividualReference>* mPossibleInstanceSet; |
| 374 |
COptimizedComplexConceptInstanziatedIndividualItemHash* mKnownInstanceItems; |
| 375 |
|
| 376 |
|
| 377 |
QSet<CRealizationIndividualInstanceItemReference>* mPossibleInstanceItemSet; |
| 378 |
QSet<CRealizationIndividualInstanceItemReference>* mPossibleInstanceCandidatePropagationItemSet; |
| 379 |
QSet<CRealizationIndividualInstanceItemReference>::const_iterator mPossibleInstanceItemSetCandidatePropagationIterator; |
| 380 |
bool mPossibleInstanceItemSetCandidatePropagationIteratorInitialized = false; |
| 381 |
cint64 mPossibleInstanceCandidatePropagationBeginningKnownInstancesCount = 0; |
| 382 |
cint64 mPossibleTestedNonInstanceCount; |
| 383 |
cint64 mRealizationRetrievedInstanceCandidateCount; |
| 384 |
|
| 385 |
cint64 mRealizationRetrievingExpectedInstanceCandidateCount; |
| 386 |
cint64 mRealizationIteratorSamplingExpectedCount; |
| 387 |
|
| 388 |
|
| 389 |
|
| 390 |
|
| 391 |
CComplexConceptItemComputationProcess mComputationProcess; |
| 392 |
|
| 393 |
bool mLazyRealizationInitialized; |
| 394 |
bool mLazyRealizationInitializationRequested; |
| 395 |
bool mLazyNeighbourRealizationPruningRequired; |
| 396 |
bool mLazyNeighbourRealizationRequested; |
| 397 |
bool mLazyRealizationInstancesRetrieved; |
| 398 |
bool mCompletelyHandledChecked; |
| 399 |
cint64 mLazyRealizationProcessingCount; |
| 400 |
|
| 401 |
|
| 402 |
COptimizedComplexVariableConceptBaseItem* mVarConBaseItem; |
| 403 |
COptimizedComplexVariableConceptSubSuperItem* mVarConSuperClassesItem; |
| 404 |
COptimizedComplexVariableConceptSubSuperItem* mVarConSubClassesItem; |
| 405 |
|
| 406 |
|
| 407 |
bool mConceptAbsorbed; |
| 408 |
cint64 mCandidatePropagationProcessingCount; |
| 409 |
bool mCandidatePropagated; |
| 410 |
bool mCandidateReceived; |
| 411 |
|
| 412 |
|
| 413 |
bool mTopObjectPropertyUsed; |
| 414 |
|
| 415 |
CRealizationIndividualInstanceItemReferenceIterator* mRealizationIterator; |
| 416 |
|
| 417 |
|
| 418 |
CRequirementWaitingDependencyData mInstancesComputationRequirments; |
| 419 |
cint64 mLastRetrievingCertainInstanceItemCount; |
| 420 |
double mMinimalRetrievingInstanceItemSize; |
| 421 |
|
| 422 |
|
| 423 |
cint64 mLastConceptInstancesCacheReportedCount; |
| 424 |
cint64 mLastConceptInstancesCacheReportedSize; |
| 425 |
|
| 426 |
|
| 427 |
// private methods |
| 428 |
private: |
| 429 |
|
| 430 |
// private variables |
| 431 |
private: |
| 432 |
|
| 433 |
}; |
| 434 |
|
| 435 |
}; // end namespace Answerer |
| 436 |
|
| 437 |
}; // end namespace Reasoner |
| 438 |
|
| 439 |
}; // end namespace Konclude |
| 440 |
|
| 441 |
#endif // KONCLUDE_REASONER_ANSWERER_COPTIMIZEDCOMPLEXCONCEPTITEM_H |