Debian Codegraph @

Source/Test/CCompletionGraphRandomWalkQueryGenerator.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_TEST_CCOMPLETIONGRAPHRANDOMWALKQUERYGENERATOR_H
22 #define KONCLUDE_TEST_CCOMPLETIONGRAPHRANDOMWALKQUERYGENERATOR_H
23
24 // Libraries includes
25 #include <QString>
26 #include <QFile>
27 #include <QDir>
28
29 // Namespace includes
30
31
32 // Other includes
33 #include "Reasoner/Kernel/Task/CSatisfiableCalculationTask.h"
34
35 #include "Reasoner/Ontology/CConcreteOntology.h"
36
37
38 // Logger includes
39 #include "Logger/CLogger.h"
40 #include "Logger/CLogIdentifier.h"
41
42
43
44 namespace Konclude {
45
46 using namespace Logger;
47
48 namespace Reasoner {
49
50 using namespace Ontology;
51
52 namespace Kernel {
53
54 namespace Algorithm {
55
56 using namespace Process;
57 using namespace Task;
58
59 /*!
60 *
61 * \class CCompletionGraphRandomWalkQueryGenerator
62 * \author Andreas Steigmiller
63 * \version 0.1
64 * \brief TODO
65 *
66 */
67 class CCompletionGraphRandomWalkQueryGenerator : public CLogIdentifier {
68
69 // public methods
70 public:
71 //! Constructor
72 CCompletionGraphRandomWalkQueryGenerator();
73
74 //! Destructor
75 virtual ~CCompletionGraphRandomWalkQueryGenerator();
76
77
78
79 void generateQueries(CSatisfiableCalculationTask* satTask);
80
81
82
83 QList<cint64> getShortestPathBetweenNodes(cint64 nodeId1, cint64 nodeId2, CSatisfiableCalculationTask* satTask);
84 QList<cint64> getRandomizedPathBetweenNodes(QList<cint64> pathList, CSatisfiableCalculationTask* satTask);
85
86 bool generateTreeFoldedCycleQuery(CSatisfiableCalculationTask* satTask);
87 bool generateRealCycleQuery(CSatisfiableCalculationTask* satTask);
88
89
90 void generateConceptTerms(CIndividualProcessNode* indiNode, QString indiVar, QSet<QString>& queryParameters, QSet<QString>& queryTermSet, QStringList& queryTerms, QHash<QString, cint64>& statisticsHash, CSatisfiableCalculationTask* satTask);
91 bool generateRoleTerm(CIndividualProcessNode* indiNode1, QString indiVar1, CIndividualProcessNode* indiNode2, QString indiVar2, QSet<QString>& queryParameters, QSet<QString>& queryTermSet, QStringList& queryTerms, QHash<QString, cint64>& varQueryUseCount, QHash<QString, cint64>& statisticsHash, CSatisfiableCalculationTask* satTask);
92
93
94 void generateTreeExpansion(CIndividualProcessNode* indiNode, QString indiVar, QSet<QString>& queryParameters, QSet<QString>& queryTermSet, QStringList& queryTerms, QHash<QString, cint64>& statisticsHash, cint64& nextTreeExpansionNr, CSatisfiableCalculationTask* satTask);
95
96
97 bool writeQuery(const QStringList& queryTerms, const QString& queryTypeString, QList<QString> selectableVariables, const QList<QString>& queryParameters, QHash<QString, cint64>& statisticsHash, CSatisfiableCalculationTask* satTask);
98 bool writeQueryStatistics(const QString& ontologyFileName, const QString& queryFileName, QHash<QString, cint64>& statisticsHash, CSatisfiableCalculationTask* satCalcTask);
99
100
101 QString getIndividualNodeQueryVariable(cint64 indiId, cint64 varId, QHash<QPair<cint64, cint64>, QString>& indiVarIdNameHash, QHash<QString, cint64>& statisticsHash, CSatisfiableCalculationTask* satTask);
102 QString getIndividualNodeQueryVariable(cint64 indiId, cint64 varId, QHash<QPair<cint64, cint64>, QString>& indiVarIdNameHash, QHash<QString, cint64>& statisticsHash, bool createDistinguishedVariableIfPossible, const QString& varPrefixString, CSatisfiableCalculationTask* satTask);
103
104
105 CIndividualProcessNode* getUpToDateIndividual(cint64 indiId, CSatisfiableCalculationTask* satTask);
106 cint64 getQueryForOntologyCount(CSatisfiableCalculationTask* satTask);
107
108 QHash<QString, cint64> getInitialStatisticsHash(CSatisfiableCalculationTask* satTask);
109
110
111 // protected methods
112 protected:
113
114 // protected variables
115 protected:
116
117 cint64 mQueryId = 0;
118
119
120 cint64 mTreeFoldedCycleQueryGenerationCount = 0;
121 cint64 mTreeFoldedCycleQueryGenerationTryCount = 200;
122 cint64 mTreeFoldedCycleQueryFailedExtractionCount = 0;
123
124 cint64 mRealCycleQueryGenerationCount = 0;
125 cint64 mRealCycleQueryGenerationTryCount = 20000;
126 cint64 mRealCycleQueryFailedExtractionCount = 0;
127
128
129 // private methods
130 private:
131
132 // private variables
133 private:
134
135 };
136
137 }; // end namespace Algorithm
138
139 }; // end namespace Kernel
140
141 }; // end namespace Reasoner
142
143 }; // end namespace Konclude
144
145 #endif // KONCLUDE_TEST_CCOMPLETIONGRAPHRANDOMWALKQUERYGENERATOR_H