Debian Codegraph @

Source/Reasoner/Kernel/Strategy/CTaskProcessingPriorityStrategy.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_REASONER_KERNEL_STRATEGY_CTASKPROCESSINGPRIORITYSTRATEGY_H
22 #define KONCLUDE_REASONER_KERNEL_STRATEGY_CTASKPROCESSINGPRIORITYSTRATEGY_H
23
24 // Libraries includes
25
26
27 // Namespace includes
28
29
30 // Other includes
31 #include "Reasoner/Ontology/CDisjunctBranchingStatistics.h"
32
33 #include "Reasoner/Kernel/Process/CConceptDescriptor.h"
34 #include "Reasoner/Kernel/Task/CSatisfiableCalculationTask.h"
35
36
37 // Logger includes
38 #include "Logger/CLogger.h"
39
40
41
42 namespace Konclude {
43
44 namespace Reasoner {
45
46 using namespace Ontology;
47
48 namespace Kernel {
49
50 using namespace Process;
51 using namespace Task;
52
53 namespace Strategy {
54
55 /*!
56 *
57 * \class CTaskProcessingPriorityStrategy
58 * \author Andreas Steigmiller
59 * \version 0.1
60 * \brief TODO
61 *
62 */
63 class CTaskProcessingPriorityStrategy {
64 // public methods
65 public:
66 //! Constructor
67 CTaskProcessingPriorityStrategy();
68
69 //! Destructor
70 virtual ~CTaskProcessingPriorityStrategy();
71
72 virtual double getPriorityForTaskBranching(CSatisfiableCalculationTask* branchingTask, CSatisfiableCalculationTask* parentTask, CIndividualProcessNode* indiProcessNode, CConceptDescriptor* branchingConcept, CSortedNegLinker<CConcept*>* branchedConcept, cint64 branchNumber, CDisjunctBranchingStatistics* branchStats) = 0;
73 virtual double getPriorityForTaskQualifing(CSatisfiableCalculationTask* branchingTask, CSatisfiableCalculationTask* parentTask, bool qualifingNegated) = 0;
74 virtual double getPriorityForTaskMerging(CSatisfiableCalculationTask* branchingTask, CSatisfiableCalculationTask* parentTask) = 0;
75 virtual double getPriorityForTaskReusing(CSatisfiableCalculationTask* branchingTask, CSatisfiableCalculationTask* parentTask, bool reusingAlternative) = 0;
76
77
78 // protected methods
79 protected:
80
81 // protected variables
82 protected:
83
84 // private methods
85 private:
86
87 // private variables
88 private:
89
90 };
91
92 }; // end namespace Strategy
93
94 }; // end namespace Kernel
95
96 }; // end namespace Reasoner
97
98 }; // end namespace Konclude
99
100 #endif // KONCLUDE_REASONER_KERNEL_STRATEGY_CTASKPROCESSINGPRIORITYSTRATEGY_H