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
|
/*
* 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 "CClassificationClassPseudoModelRoleData.h"
namespace Konclude {
namespace Reasoner {
namespace Classifier {
CClassificationClassPseudoModelRoleData::CClassificationClassPseudoModelRoleData() {
mLowerAtLeast = 0;
mUpperAtLeast = 0;
mLowerAtMost = 0;
mUpperAtMost = 0;
mSuccessorModel = 0;
}
cint64 CClassificationClassPseudoModelRoleData::getLowerAtLeastBound() {
return mLowerAtLeast;
}
cint64 CClassificationClassPseudoModelRoleData::getUpperAtLeastBound() {
return mUpperAtLeast;
}
cint64 CClassificationClassPseudoModelRoleData::getLowerAtMostBound() {
return mLowerAtMost;
}
cint64 CClassificationClassPseudoModelRoleData::getUpperAtMostBound() {
return mUpperAtMost;
}
bool CClassificationClassPseudoModelRoleData::setLowerAtLeastBound(cint64 bound) {
bool diff = mLowerAtLeast != bound;
mLowerAtLeast = bound;
return diff;
}
bool CClassificationClassPseudoModelRoleData::setUpperAtLeastBound(cint64 bound) {
bool diff = mUpperAtLeast != bound;
mUpperAtLeast = bound;
return diff;
}
bool CClassificationClassPseudoModelRoleData::setLowerAtMostBound(cint64 bound) {
bool diff = mLowerAtMost != bound;
mLowerAtMost = bound;
return diff;
}
bool CClassificationClassPseudoModelRoleData::setUpperAtMostBound(cint64 bound) {
bool diff = mUpperAtMost != bound;
mUpperAtMost = bound;
return diff;
}
cint64 CClassificationClassPseudoModelRoleData::getSuccessorModelID() const {
return mSuccessorModel;
}
bool CClassificationClassPseudoModelRoleData::setSuccessorModelID(cint64 modelID) {
bool diff = mSuccessorModel != modelID;
mSuccessorModel = modelID;
return diff;
}
bool CClassificationClassPseudoModelRoleData::isPossibleSubsumerOf(const CClassificationClassPseudoModelRoleData& possibleSubsumedData) const {
if (mDeterministicFlag) {
if (mLowerAtLeast > possibleSubsumedData.mUpperAtLeast) {
return false;
}
if (mUpperAtMost < possibleSubsumedData.mLowerAtMost) {
return false;
}
return true;
} else {
return true;
}
}
}; // end namespace Classifier
}; // end namespace Reasoner
}; // end namespace Konclude
|