Debian Codegraph @

Source/Reasoner/Kernel/Algorithm/CSatisfiableTaskIncrementalConsistencyPreyingAnalyser.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_ALGORITHM_CSATISFIABLETASKINCREMENTALCONSISTENCYPREYINGANALYSER_H
22 #define KONCLUDE_REASONER_KERNEL_ALGORITHM_CSATISFIABLETASKINCREMENTALCONSISTENCYPREYINGANALYSER_H
23
24 // Libraries includes
25
26
27 // Namespace includes
28 #include "CCalculationAlgorithmContext.h"
29 #include "CSatisfiableConsistencyPreyingAnalyser.h"
30
31 // Other includes
32 #include "Reasoner/Kernel/Task/CSatisfiableCalculationTask.h"
33 #include "Reasoner/Kernel/Task/CIncrementalConsistenceTaskData.h"
34
35 // Logger includes
36 #include "Logger/CLogger.h"
37
38
39
40
41 namespace Konclude {
42
43 namespace Reasoner {
44
45 namespace Kernel {
46
47 using namespace Task;
48
49 namespace Algorithm {
50
51 /*!
52 *
53 * \class CSatisfiableTaskIncrementalConsistencyPreyingAnalyser
54 * \author Andreas Steigmiller
55 * \version 0.1
56 * \brief TODO
57 *
58 */
59 class CSatisfiableTaskIncrementalConsistencyPreyingAnalyser : public CSatisfiableConsistencyPreyingAnalyser {
60 // public methods
61 public:
62 //! Constructor
63 CSatisfiableTaskIncrementalConsistencyPreyingAnalyser();
64
65 //! Destructor
66 virtual ~CSatisfiableTaskIncrementalConsistencyPreyingAnalyser();
67
68 bool analyseSatisfiableTask(CSatisfiableCalculationTask* statCalcTask, CCalculationAlgorithmContext* calcAlgContext);
69
70
71
72 // protected methods
73 protected:
74
75 bool analyseIncrementalChanges(CSatisfiableCalculationTask* statCalcTask, CIncrementalConsistenceTaskData* incConsData, CCalculationAlgorithmContext* calcAlgContext);
76
77 CIndividualProcessNode* getMergedIntoIndividualNode(CIndividualProcessNode* indiNode, CIndividualProcessNodeVector* indiNodeVec, CCalculationAlgorithmContext* calcAlgContext);
78 CIndividualProcessNode* getSuccessorIndividual(CIndividualProcessNode*& indi, CIndividualLinkEdge* link, CCalculationAlgorithmContext* calcAlgContext);
79
80 // protected variables
81 protected:
82
83 // private methods
84 private:
85
86 // private variables
87 private:
88
89 };
90
91 }; // end namespace Algorithm
92
93 }; // end namespace Kernel
94
95 }; // end namespace Reasoner
96
97 }; // end namespace Konclude
98
99 #endif // KONCLUDE_REASONER_KERNEL_ALGORITHM_CSATISFIABLETASKINCREMENTALCONSISTENCYPREYINGANALYSER_H