Debian Codegraph @

Source/Reasoner/Kernel/Strategy/CGenerativeNonDeterministicUnsatisfiableCacheRetrievalStrategy.cpp

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 #include "CGenerativeNonDeterministicUnsatisfiableCacheRetrievalStrategy.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Kernel {
29
30 namespace Strategy {
31
32
33 CGenerativeNonDeterministicUnsatisfiableCacheRetrievalStrategy::CGenerativeNonDeterministicUnsatisfiableCacheRetrievalStrategy() {
34 }
35
36
37 CGenerativeNonDeterministicUnsatisfiableCacheRetrievalStrategy::~CGenerativeNonDeterministicUnsatisfiableCacheRetrievalStrategy() {
38 }
39
40 bool CGenerativeNonDeterministicUnsatisfiableCacheRetrievalStrategy::testUnsatisfiableCacheForProcessing(CConceptProcessDescriptor* conProDes, CIndividualProcessNode *indi) {
41 return false;
42 }
43
44
45 bool CGenerativeNonDeterministicUnsatisfiableCacheRetrievalStrategy::testUnsatisfiableCacheForDisjunctionBranching(CConceptProcessDescriptor *conProDes, CIndividualProcessNode *indi, CPROCESSINGLIST< CSortedNegLinker<CConcept*>* >* disjunctList) {
46 return true;
47 }
48
49 bool CGenerativeNonDeterministicUnsatisfiableCacheRetrievalStrategy::testUnsatisfiableCacheForMergingInitialization(CConceptProcessDescriptor* conProDes, CIndividualProcessNode *indi) {
50 return true;
51 }
52
53
54 bool CGenerativeNonDeterministicUnsatisfiableCacheRetrievalStrategy::testUnsatisfiableCacheForSuccessorGeneration(CConceptProcessDescriptor* conProDes, CIndividualProcessNode *indi) {
55 return true;
56 }
57
58
59 bool CGenerativeNonDeterministicUnsatisfiableCacheRetrievalStrategy::testUnsatisfiableCacheForBranchedDisjuncts(CConceptProcessDescriptor *conProDes, CIndividualProcessNode *indi, CSortedNegLinker<CConcept*>* orDisjunctConcept) {
60 return true;
61 }
62
63 bool CGenerativeNonDeterministicUnsatisfiableCacheRetrievalStrategy::testUnsatisfiableCacheForMergedIndividualNodes(CConceptProcessDescriptor *conProDes, CIndividualProcessNode *indi, CIndividualProcessNode *mergedIndi) {
64 return true;
65 }
66
67 bool CGenerativeNonDeterministicUnsatisfiableCacheRetrievalStrategy::testUnsatisfiableCacheForQualifiedIndividualNodes(CConceptProcessDescriptor *conProDes, CIndividualProcessNode *indi, CIndividualProcessNode *mergedIndi) {
68 return true;
69 }
70
71
72
73 }; // end namespace Strategy
74
75 }; // end namespace Kernel
76
77 }; // end namespace Reasoner
78
79 }; // end namespace Konclude