Debian Codegraph @

Source/Reasoner/Kernel/Strategy/CUnsatisfiableCacheRetrievalStrategy.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_CUNSATISFIABLECACHERETRIEVALSTRATEGY_H
22 #define KONCLUDE_REASONER_KERNEL_STRATEGY_CUNSATISFIABLECACHERETRIEVALSTRATEGY_H
23
24 // Libraries includes
25
26
27 // Namespace includes
28
29
30 // Other includes
31 #include "Reasoner/Kernel/Algorithm/AlgorithmSettings.h"
32
33 #include "Reasoner/Kernel/Process/CConceptProcessDescriptor.h"
34 #include "Reasoner/Kernel/Process/CIndividualProcessNode.h"
35
36 // Logger includes
37 #include "Logger/CLogger.h"
38
39
40
41 namespace Konclude {
42
43 namespace Reasoner {
44
45 namespace Kernel {
46
47 using namespace Process;
48 using namespace Algorithm;
49
50 namespace Strategy {
51
52 /*!
53 *
54 * \class CUnsatisfiableCacheRetrievalStrategy
55 * \author Andreas Steigmiller
56 * \version 0.1
57 * \brief TODO
58 *
59 */
60 class CUnsatisfiableCacheRetrievalStrategy {
61 // public methods
62 public:
63 //! Constructor
64 CUnsatisfiableCacheRetrievalStrategy();
65
66 //! Destructor
67 virtual ~CUnsatisfiableCacheRetrievalStrategy();
68
69 virtual bool testUnsatisfiableCacheForProcessing(CConceptProcessDescriptor* conProDes, CIndividualProcessNode *indi) = 0;
70 virtual bool testUnsatisfiableCacheForDisjunctionBranching(CConceptProcessDescriptor *conProDes, CIndividualProcessNode *indi, CPROCESSINGLIST< CSortedNegLinker<CConcept*>* >* disjunctList) = 0;
71 virtual bool testUnsatisfiableCacheForMergingInitialization(CConceptProcessDescriptor* conProDes, CIndividualProcessNode *indi) = 0;
72 virtual bool testUnsatisfiableCacheForSuccessorGeneration(CConceptProcessDescriptor* conProDes, CIndividualProcessNode *indi) = 0;
73 virtual bool testUnsatisfiableCacheForBranchedDisjuncts(CConceptProcessDescriptor *conProDes, CIndividualProcessNode *indi, CSortedNegLinker<CConcept*>* orDisjunctConcept) = 0;
74 virtual bool testUnsatisfiableCacheForMergedIndividualNodes(CConceptProcessDescriptor *conProDes, CIndividualProcessNode *indi, CIndividualProcessNode *mergedIndi) = 0;
75 virtual bool testUnsatisfiableCacheForQualifiedIndividualNodes(CConceptProcessDescriptor *conProDes, CIndividualProcessNode *indi, CIndividualProcessNode *mergedIndi) = 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_CUNSATISFIABLECACHERETRIEVALSTRATEGY_H