Debian Codegraph @

Source/Reasoner/Taxonomy/CAbstractHierarchy.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_TAXONOMY_CABSTRACTHIERARCHY_H
22 #define KONCLUDE_REASONER_TAXONOMY_CABSTRACTHIERARCHY_H
23
24 // Libraries includes
25
26
27 // Namespace includes
28 #include "TaxonomySettings.h"
29 #include "CHierarchy.h"
30
31 // Other includes
32
33
34 // Logger includes
35 #include "Logger/CLogger.h"
36
37
38 namespace Konclude {
39
40 namespace Reasoner {
41
42 namespace Taxonomy {
43
44
45 /*!
46 *
47 * \class CATaxonomy
48 * \author Andreas Steigmiller
49 * \version 0.1
50 * \brief TODO
51 *
52 */
53 template<class T, class N, class E>
54 class CAbstractHierarchy : public CHierarchy {
55 // public methods
56 public:
57 //! Constructor
58 CAbstractHierarchy();
59
60
61 virtual N* getTopHierarchyNode() = 0;
62 virtual N* getBottomHierarchyNode() = 0;
63
64 virtual N* getHierarchyNode(const E& element) = 0;
65 virtual bool hasHierarchyNode(const E& element) = 0;
66
67
68 bool isElementSubsumption(const E& subsumerElement, const E& subsumedElement);
69 bool isElementEquivalence(const E& element1, const E& element2);
70 bool isElementSatisfiable(const E& element);
71 bool isElementNotSatisfiable(const E& element);
72
73
74 bool isTopHierarchyElement(const E& element);
75 bool isBottomHierarchyElement(const E& element);
76
77
78
79 virtual bool isNodeSubsumption(N* subsumerNode, N* subsumedNode) = 0;
80 virtual bool isNodeEquivalence(N* node1, N* node2) = 0;
81 virtual bool isNodeSatisfiable(N* node) = 0;
82 virtual bool isNodeNotSatisfiable(N* node) = 0;
83
84 virtual bool isTopHierarchyNode(N* element) = 0;
85 virtual bool isBottomHierarchyNode(N* element) = 0;
86
87
88
89 // protected methods
90 protected:
91
92 // protected variables
93 protected:
94
95 // private methods
96 private:
97
98 // private variables
99 private:
100
101 };
102
103 }; // end namespace Taxonomy
104
105 }; // end namespace Reasoner
106
107 }; // end namespace Konclude
108
109 #include "CAbstractHierarchy.cpp"
110
111 #endif // KONCLUDE_REASONER_TAXONOMY_CABSTRACTHIERARCHY_H