File: COptimizedConceptSaturationSatisfiableTestingItem.h

package info (click to toggle)
konclude 0.7.0%2B1138%2Bgit20220514~dfsg-1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm, forky, sid, trixie
  • size: 48,500 kB
  • sloc: cpp: 378,255; xml: 116,067; sh: 66; makefile: 38; ansic: 3
file content (138 lines) | stat: -rw-r--r-- 4,484 bytes parent folder | download | duplicates (2)
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
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
/*
 *		Copyright (C) 2013-2015, 2019 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 3 of the GNU Lesser General Public
 *		License (LGPLv3) as published by the Free Software Foundation.
 *
 *		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. See the
 *		GNU (Lesser) General Public License for more details.
 *
 *		You should have received a copy of the GNU (Lesser) General Public
 *		License along with Konclude. If not, see <http://www.gnu.org/licenses/>.
 *
 */

#ifndef KONCLUDE_REASONER_CLASSIFIER_COPTIMIZEDCONCEPTSATURATIONSATISFIABLETESTINGITEM_H
#define KONCLUDE_REASONER_CLASSIFIER_COPTIMIZEDCONCEPTSATURATIONSATISFIABLETESTINGITEM_H

// Libraries includes


// Namespace includes
#include "ClassifierSettings.h"
#include "CClassificationConceptReferenceLinking.h"


// Other includes
#include "Reasoner/Ontology/CConcept.h"
#include "Reasoner/Ontology/CConceptReferenceLinking.h"
#include "Reasoner/Taxonomy/CHierarchyNode.h"


// Logger includes
#include "Logger/CLogger.h"


namespace Konclude {

	namespace Reasoner {

		using namespace Ontology;
		using namespace Taxonomy;

		namespace Classifier {


			/*! 
			 *
			 *		\class		COptimizedConceptSaturationSatisfiableTestingItem
			 *		\author		Andreas Steigmiller
			 *		\version	0.1
			 *		\brief		TODO
			 *
			 */
			class COptimizedConceptSaturationSatisfiableTestingItem : public CClassificationConceptReferenceLinking {
				// public methods
				public:
					//! Constructor
					COptimizedConceptSaturationSatisfiableTestingItem();


					COptimizedConceptSaturationSatisfiableTestingItem* initConceptSatisfiableTestingItem(CConcept* satTestConcept);
					CConcept* getSatisfiableConcept();

					virtual bool isClassSatisfiableTestingItem();

					CConceptReferenceLinking* getConceptReferenceLinking();
					COptimizedConceptSaturationSatisfiableTestingItem* setConceptReferenceLinking(CConceptReferenceLinking* refLinking);


					QList<COptimizedConceptSaturationSatisfiableTestingItem*>* getExistReferenceConceptItemList();
					COptimizedConceptSaturationSatisfiableTestingItem* addExistReferenceConceptItemList(COptimizedConceptSaturationSatisfiableTestingItem* existItem);


					bool isOrderingQueued();
					COptimizedConceptSaturationSatisfiableTestingItem* setOrderingQueued(bool queued);

					bool hasIndirectSuccessorsItems();
					COptimizedConceptSaturationSatisfiableTestingItem* setIndirectSuccessorsItems(bool hasSuccessors);

					bool hasPilingReferenceItem();
					COptimizedConceptSaturationSatisfiableTestingItem* setPilingReferenceItem(bool piledReference);

					bool hasMultipleDirectPredecessorsItems();
					COptimizedConceptSaturationSatisfiableTestingItem* setMultipleDirectPredecessorsItems(bool multiblePredItems);


					// for piling saturation algorithm
					enum SATURATIONITEMREFERENCESPECIALMODE { NONESATURATIONMODE, SATURATIONCOPYMODE, SATURATIONPILINGMODE, SATURATIONSUBSTITUTEMODE };

					COptimizedConceptSaturationSatisfiableTestingItem* getSpecialItemReference();
					COptimizedConceptSaturationSatisfiableTestingItem* setSpecialItemReference(COptimizedConceptSaturationSatisfiableTestingItem* reference);
					SATURATIONITEMREFERENCESPECIALMODE getSpecialReferenceMode();
					COptimizedConceptSaturationSatisfiableTestingItem* setSpecialItemReferenceMode(SATURATIONITEMREFERENCESPECIALMODE mode);


				// protected methods
				protected:

				// protected variables
				protected:
					CConcept* mConceptSat;

					QList<COptimizedConceptSaturationSatisfiableTestingItem*> mExistReferenceItemList;

					bool mOrderingQueued;
					bool mPilingReference;
					bool mSucessorsItems;
					bool mMultiplePredItems;

					CConceptReferenceLinking* mConRefLinking;

					COptimizedConceptSaturationSatisfiableTestingItem* mSpecialItemReference;
					SATURATIONITEMREFERENCESPECIALMODE mSpecialReferenceMode;

					//QString mSubsumingConceptString;


				// private methods
				private:

				// private variables
				private:

			};

		}; // end namespace Classifier

	}; // end namespace Reasoner

}; // end namespace Konclude

#endif // KONCLUDE_REASONER_CLASSIFIER_COPTIMIZEDCONCEPTSATURATIONSATISFIABLETESTINGITEM_H