1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
|
/*
* Copyright (C) 2013, 2014, 2015 by the Konclude Developer Team.
*
* This file is part of the reasoning system Konclude.
* For details and support, see <http://konclude.com/>.
*
* Konclude is free software: you can redistribute it and/or modify it under
* the terms of version 2.1 of the GNU Lesser General Public License (LGPL2.1)
* as published by the Free Software Foundation.
*
* You should have received a copy of the GNU Lesser General Public License
* along with Konclude. If not, see <http://www.gnu.org/licenses/>.
*
* 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. For more
* details, see GNU Lesser General Public License.
*
*/
#ifndef KONCLUDE_REASONER_PREPROCESS_CDISJUNCTSORTINGPREPROCESS_H
#define KONCLUDE_REASONER_PREPROCESS_CDISJUNCTSORTINGPREPROCESS_H
// Libraries includes
// Namespace includes
#include "CConcreteOntologyPreProcess.h"
#include "CConceptRoleIndividualLocator.h"
// Other includes
#include "Reasoner/Ontology/CConceptRoleBranchingTrigger.h"
// Logger includes
#include "Logger/CLogger.h"
namespace Konclude {
namespace Reasoner {
using namespace Ontology;
namespace Preprocess {
/*!
*
* \class CDisjunctSortingPreProcess
* \author Andreas Steigmiller
* \version 0.1
* \brief TODO
*
*/
class CDisjunctSortingPreProcess : public CConcreteOntologyPreProcess {
// public methods
public:
//! Constructor
CDisjunctSortingPreProcess();
//! Destructor
virtual ~CDisjunctSortingPreProcess();
virtual CConcreteOntology *preprocess(CConcreteOntology *ontology, CPreProcessContext* context);
// protected methods
protected:
void sortDisjuncts(CConcept* concept, bool negated);
void addDisjunctFromList(QList< CSortedNegLinker<CConcept*>* >& disjunctList, CSortedNegLinker<CConcept*>*& newOperandLinker, CSortedNegLinker<CConcept*>*& lastNewOperandLinker);
void addDisjunctToSort(CSortedNegLinker<CConcept*>* conLinker, bool negated);
// protected variables
protected:
CMemoryAllocationManager* mMemMan;
cint64 mSortedDisjunctCount;
cint64 mPotentialDisjunctionCount;
CConcreteOntology* mOnto;
CConceptVector* mConceptVec;
CTBox* mTBox;
QList< CSortedNegLinker<CConcept*>* > mAtomicDisjList;
QList< CSortedNegLinker<CConcept*>* > mPrimNegDisjList;
QList< CSortedNegLinker<CConcept*>* > mSimpleExistDisjList;
QList< CSortedNegLinker<CConcept*>* > mExistDisjList;
QList< CSortedNegLinker<CConcept*>* > mNegNominalDisjList;
QList< CSortedNegLinker<CConcept*>* > mPosNominalDisjList;
QList< CSortedNegLinker<CConcept*>* > mPropDisjList;
QList< CSortedNegLinker<CConcept*>* > mTriggerDisjList;
QList< CSortedNegLinker<CConcept*>* > mImplDisjList;
QList< CSortedNegLinker<CConcept*>* > mOtherDisjList;
// private methods
private:
// private variables
private:
};
}; // end namespace Preprocess
}; // end namespace Reasoner
}; // end namespace Konclude
#endif // KONCLUDE_REASONER_PREPROCESS_CDISJUNCTSORTINGPREPROCESS_H
|
