Debian Codegraph @

Source/Reasoner/Classifier/CPartialPruningHierarchyNode.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_CLASSIFIER_CPARTIALPRUNINGHIERARCHYNODE_H
22 #define KONCLUDE_REASONER_CLASSIFIER_CPARTIALPRUNINGHIERARCHYNODE_H
23
24 // Libraries includes
25
26
27 // Namespace includes
28 #include "ClassifierSettings.h"
29 #include "CClassifierStatistics.h"
30
31 // Other includes
32 #include "Reasoner/Taxonomy/CHierarchyNode.h"
33
34 // Logger includes
35 #include "Logger/CLogger.h"
36
37
38 namespace Konclude {
39
40 namespace Reasoner {
41
42 using namespace Taxonomy;
43
44 namespace Classifier {
45
46
47
48 /*!
49 *
50 * \class CPartialPruningHierarchyNode
51 * \author Andreas Steigmiller
52 * \version 0.1
53 * \brief TODO
54 *
55 */
56 class CPartialPruningHierarchyNode : public CHierarchyNode {
57 // public methods
58 public:
59 //! Constructor
60 CPartialPruningHierarchyNode(CConcept *representiveConcept);
61
62 //! Destructor
63 virtual ~CPartialPruningHierarchyNode();
64
65 virtual CHierarchyNode *repairParentNodeInsertion(CHierarchyNode *replacedParentNodeCandidate, CClassifierStatistics *statistics = 0);
66 virtual CHierarchyNode *repairChildsParentNodeReplacement(CHierarchyNode *replacedParentNodeCandidate, CClassifierStatistics *statistics = 0);
67
68 virtual CHierarchyNode *mergeToParentNode(CHierarchyNode *mergeParentDirection, CClassifierStatistics *statistics = 0);
69
70 virtual CHierarchyNode *propagateTransitiveRelations(CClassifierStatistics *statistics = 0);
71 virtual CHierarchyNode *propagateTransitivePredecessorRelation(CHierarchyNode *transAddPredNode, CClassifierStatistics *statistics = 0);
72
73 virtual CHierarchyNode *pruneTransitiveRelations(CHierarchyNode *incompNode, CClassifierStatistics *statistics = 0);
74
75 CHierarchyNode* repairChildNodes(CClassifierStatistics *statistics);
76 CHierarchyNode* repairParentNodes(CClassifierStatistics *statistics);
77
78 // protected methods
79 protected:
80
81 // protected variables
82 protected:
83
84
85 // private methods
86 private:
87
88 // private variables
89 private:
90
91 };
92
93 }; // end namespace Classifier
94
95 }; // end namespace Reasoner
96
97 }; // end namespace Konclude
98
99 #endif // KONCLUDE_REASONER_CLASSIFIER_CPARTIALPRUNINGHIERARCHYNODE_H