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
|
/*
* 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/>.
*
*/
#include "CClassClassificationComputationItem.h"
namespace Konclude {
namespace Reasoner {
namespace Classifier {
CClassClassificationComputationItem::CClassClassificationComputationItem(CSatisfiableCalculationJob* satCalcJob, CConcept *satisfiableTestedConcept) {
mSatCalcJob = satCalcJob;
testValid = true;
conceptSatisfiableTest = true;
conceptSubsumptionTest = false;
con0 = satisfiableTestedConcept;
con1 = 0;
}
CClassClassificationComputationItem::CClassClassificationComputationItem(CSatisfiableCalculationJob* satCalcJob, CConcept *subsumerTestedConcept, CConcept *subsumedTestedConcept) {
mSatCalcJob = satCalcJob;
testValid = true;
conceptSatisfiableTest = false;
conceptSubsumptionTest = true;
con0 = subsumerTestedConcept;
con1 = subsumedTestedConcept;
}
CClassClassificationComputationItem::~CClassClassificationComputationItem() {
}
bool CClassClassificationComputationItem::isConceptSatisfiableTest() {
return conceptSatisfiableTest;
}
bool CClassClassificationComputationItem::isConceptSubsumptionTest() {
return conceptSubsumptionTest;
}
CConcept *CClassClassificationComputationItem::getSatisfiableTestedConcept() {
if (conceptSatisfiableTest) {
return con0;
}
return 0;
}
CConcept *CClassClassificationComputationItem::getSubsumerTestedConcept() {
if (conceptSubsumptionTest) {
return con0;
}
return 0;
}
CConcept *CClassClassificationComputationItem::getSubsumedTestedConcept() {
if (conceptSubsumptionTest) {
return con1;
}
return 0;
}
bool CClassClassificationComputationItem::isTestValid() {
return testValid;
}
CClassClassificationComputationItem *CClassClassificationComputationItem::setTestInvalid() {
testValid = false;
return this;
}
CSatisfiableCalculationJob* CClassClassificationComputationItem::getSatisfiableCalculationJob()
{
return mSatCalcJob;
}
bool CClassClassificationComputationItem::testIsTestRedundant(CTaxonomy *taxonomy) {
bool redundant = false;
if (conceptSatisfiableTest) {
if (taxonomy->isSatisfiable(con0) || taxonomy->isNotSatisfiable(con0)) {
redundant = true;
}
} else if (conceptSubsumptionTest) {
if (taxonomy->isSubsumption(con0,con1) || taxonomy->isNotSubsumption(con0,con1)) {
redundant = true;
}
}
return redundant;
}
}; // end namespace Classifier
}; // end namespace Reasoner
}; // end namespace Konclude
|
