Debian Codegraph @

Source/Reasoner/Preprocess/CDisjunctSortingPreProcess.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_PREPROCESS_CDISJUNCTSORTINGPREPROCESS_H
22 #define KONCLUDE_REASONER_PREPROCESS_CDISJUNCTSORTINGPREPROCESS_H
23
24 // Libraries includes
25
26 // Namespace includes
27 #include "CConcreteOntologyContinuablePreProcess.h"
28 #include "CConceptRoleIndividualLocator.h"
29
30
31 // Other includes
32 #include "Reasoner/Ontology/CConceptRoleBranchingTrigger.h"
33
34 // Logger includes
35 #include "Logger/CLogger.h"
36
37
38
39 namespace Konclude {
40
41 namespace Reasoner {
42
43 using namespace Ontology;
44
45 namespace Preprocess {
46
47 /*!
48 *
49 * \class CDisjunctSortingPreProcess
50 * \author Andreas Steigmiller
51 * \version 0.1
52 * \brief TODO
53 *
54 */
55 class CDisjunctSortingPreProcess : public CConcreteOntologyContinuablePreProcess {
56 // public methods
57 public:
58 //! Constructor
59 CDisjunctSortingPreProcess();
60
61 //! Destructor
62 virtual ~CDisjunctSortingPreProcess();
63
64 virtual CConcreteOntology *preprocess(CConcreteOntology *ontology, CPreProcessContext* context);
65 virtual CConcreteOntology* continuePreprocessing();
66
67 // protected methods
68 protected:
69 CDisjunctSortingPreProcess* sortDisjuncts();
70
71 void sortDisjuncts(CConcept* concept, bool negated);
72
73 void addDisjunctFromList(QList< CSortedNegLinker<CConcept*>* >& disjunctList, CSortedNegLinker<CConcept*>*& newOperandLinker, CSortedNegLinker<CConcept*>*& lastNewOperandLinker);
74
75 void addDisjunctToSort(CSortedNegLinker<CConcept*>* conLinker, bool negated);
76
77
78 // protected variables
79 protected:
80 CMemoryAllocationManager* mMemMan;
81
82 cint64 mSortedDisjunctCount;
83 cint64 mPotentialDisjunctionCount;
84
85 CConcreteOntology* mOnto;
86 CConceptVector* mConceptVec;
87 CTBox* mTBox;
88
89
90 QList< CSortedNegLinker<CConcept*>* > mAtomicDisjList;
91 QList< CSortedNegLinker<CConcept*>* > mPrimNegDisjList;
92 QList< CSortedNegLinker<CConcept*>* > mPrimDisjList;
93 QList< CSortedNegLinker<CConcept*>* > mSimpleExistDisjList;
94 QList< CSortedNegLinker<CConcept*>* > mExistDisjList;
95 QList< CSortedNegLinker<CConcept*>* > mNegNominalDisjList;
96 QList< CSortedNegLinker<CConcept*>* > mPosNominalDisjList;
97 QList< CSortedNegLinker<CConcept*>* > mPropDisjList;
98 QList< CSortedNegLinker<CConcept*>* > mTriggerDisjList;
99 QList< CSortedNegLinker<CConcept*>* > mImplDisjList;
100 QList< CSortedNegLinker<CConcept*>* > mOtherDisjList;
101
102 cint64 mLastConceptId;
103
104
105 // private methods
106 private:
107
108 // private variables
109 private:
110
111
112 };
113
114 }; // end namespace Preprocess
115
116 }; // end namespace Reasoner
117
118 }; // end namespace Konclude
119
120 #endif // KONCLUDE_REASONER_PREPROCESS_CDISJUNCTSORTINGPREPROCESS_H