File: CReasonerEvaluationExpressivityRequestSelector.cpp

package info (click to toggle)
konclude 0.7.0%2B1137~dfsg-1
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 48,824 kB
  • sloc: cpp: 378,238; xml: 116,067; makefile: 38; sh: 8; ansic: 3
file content (120 lines) | stat: -rw-r--r-- 4,207 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
/*
 *		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 "CReasonerEvaluationExpressivityRequestSelector.h"


namespace Konclude {

	namespace Test {

		namespace Evaluation {


			CReasonerEvaluationExpressivityRequestSelector::CReasonerEvaluationExpressivityRequestSelector(const QList<COntologyExpressivity>& equalBoundList, const QString& baseExpressivityDir) {
				mEqualBoundList = equalBoundList;
				mBaseExpressivityDir = baseExpressivityDir;
			}

			CReasonerEvaluationExpressivityRequestSelector::CReasonerEvaluationExpressivityRequestSelector(const QList<COntologyExpressivity>& lowerNotIncludedBoundList, const QList<COntologyExpressivity>& upperIncludedBoundList, const QString& baseExpressivityDir) {
				mLowerNotIncludedBoundList = lowerNotIncludedBoundList;
				mUpperIncludedBoundList = upperIncludedBoundList;
				mBaseExpressivityDir = baseExpressivityDir;
			}


			CReasonerEvaluationExpressivityRequestSelector::CReasonerEvaluationExpressivityRequestSelector() {
			}


			bool CReasonerEvaluationExpressivityRequestSelector::isGroupSelected(const QString& groupString) {
				return true;
			}

			bool CReasonerEvaluationExpressivityRequestSelector::isRequestSelected(const QString& groupString, const QString& requestString) {
				QString expressivityString;
				bool foundExpressivity = false;
				QString infoFileString = mBaseExpressivityDir+groupString+requestString+".txt";
				QFile infoFile(infoFileString);
				if (infoFile.open(QIODevice::ReadOnly)) {
					while (!foundExpressivity && !infoFile.atEnd()) {
						QString line = infoFile.readLine();
						QStringList keyValueLists = line.split("\t");
						if (keyValueLists.count() >= 2) {
							if (keyValueLists.first().trimmed() == "Expressivness:") {
								foundExpressivity = true;
								expressivityString = keyValueLists.last().trimmed();
							}
						}
					}
					infoFile.close();
				}
				if (!foundExpressivity) {
					return false;
				} else {
					COntologyExpressivity expressivity(expressivityString);
					foreach (COntologyExpressivity expBound, mEqualBoundList) {
						if (expressivity.isExpressivityEqual(&expBound)) {
							return true;
						}
					}
					if (!mEqualBoundList.isEmpty()) {
						return false;
					}
					foreach (COntologyExpressivity expBound, mExcludedBoundList) {
						if (expressivity.isExpressivityEqual(&expBound)) {
							return false;
						}
					}
					foreach (COntologyExpressivity expBound, mLowerNotIncludedBoundList) {
						if (expBound.isExpressivityEntailed(&expressivity)) {
							return false;
						}
					}
					foreach (COntologyExpressivity expBound, mLowerIncludedBoundList) {
						if (expBound.isExpressivityEntailed(&expressivity) && !expressivity.isExpressivityEqual(&expBound)) {
							return false;
						}
					}
					bool entailedByOneUpperBounds = false;
					foreach (COntologyExpressivity expBound, mUpperNotIncludedBoundList) {
						if (expBound.isExpressivityEntailed(&expressivity) || !expressivity.isExpressivityEqual(&expBound)) {
							entailedByOneUpperBounds |= true;
						}
					}
					foreach (COntologyExpressivity expBound, mUpperIncludedBoundList) {
						if (expBound.isExpressivityEntailed(&expressivity)) {
							entailedByOneUpperBounds |= true;
						}
					}
					if (!entailedByOneUpperBounds) {
						return false;
					}
				}
				return true;
			}



		}; // end namespace Evaluation

	}; // end namespace Test

}; // end namespace Konclude