1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
|
/* This file is part of the FaCT++ DL reasoner
Copyright (C) 2003-2015 Dmitry Tsarkov and The University of Manchester
Copyright (C) 2015-2016 Dmitry Tsarkov
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
This library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include "Reasoner.h"
// uncomment the following line to debug cascaded caching
//#define TMP_CACHE_DEBUG
const modelCacheInterface*
DlSatTester :: createCache ( BipolarPointer p )
{
fpp_assert ( isValid(p) ); // safety check
const modelCacheInterface* cache;
// check if cache already calculated
if ( (cache = DLHeap.getCache(p)) != NULL )
return cache;
#ifdef TMP_CACHE_DEBUG
std::cerr << "\nCCache for " << p << ":";
#endif
if ( !unlikely(tBox.testHasTopRole()) )
prepareCascadedCache(p);
// it may be a cycle and the cache for p is already calculated
if ( (cache = DLHeap.getCache(p)) != NULL )
return cache;
// need to build cache
DLHeap.setCache ( p, buildCache(p) );
return DLHeap.getCache(p);
}
void
DlSatTester :: prepareCascadedCache ( BipolarPointer p )
{
/// cycle found -- shall be processed without caching
if ( inProcess.find(p) != inProcess.end() )
{
# ifdef TMP_CACHE_DEBUG
std::cerr << " cycle with " << p << ";";
# endif
return;
}
const DLVertex& v = DLHeap[p];
bool pos = isPositive(p);
// check if a concept already cached
if ( v.getCache(pos) != NULL )
return;
switch ( v.Type() )
{
case dtTop: // no need to put cache for this
break;
case dtDataType: // data things are checked by data reasoner
case dtDataValue:
case dtDataExpr:
break;
case dtAnd:
{
for ( DLVertex::const_iterator q = v.begin(), q_end = v.end(); q < q_end; ++q )
prepareCascadedCache(createBiPointer(*q,pos));
break;
}
case dtPSingleton:
case dtNSingleton:
case dtNConcept:
case dtPConcept:
if ( isNegative(p) && isPNameTag(v.Type()) )
return;
inProcess.insert(p);
# ifdef TMP_CACHE_DEBUG
std::cerr << " expanding " << p << ";";
# endif
prepareCascadedCache(createBiPointer(v.getC(),pos));
inProcess.erase(p);
break;
case dtForall:
case dtLE:
{
const TRole* R = v.getRole();
if ( R->isDataRole() ) // skip data-related stuff
break;
if ( unlikely(R->isTop()) ) // no need to cache top-role stuff
break;
BipolarPointer x = createBiPointer(v.getC(),pos);
// build cache for C in \AR.C
if ( x != bpTOP )
{
inProcess.insert(x);
# ifdef TMP_CACHE_DEBUG
std::cerr << " caching " << x << ";";
# endif
createCache(x);
inProcess.erase(x);
}
// build cache for the Range(R) if necessary
x = R->getBPRange();
if ( x != bpTOP )
{
inProcess.insert(x);
# ifdef TMP_CACHE_DEBUG
std::cerr << " caching range(" << v.getRole()->getName() << ") = " << x << ";";
# endif
createCache(x);
inProcess.erase(x);
}
break;
}
case dtIrr:
break;
default:
fpp_unreachable();
}
}
/// build cache for given DAG node using SAT tests; @return cache
modelCacheInterface*
DlSatTester :: buildCache ( BipolarPointer p )
{
if ( LLM.isWritable(llDagSat) )
{
LL << "\nChecking satisfiability of DAG entry " << p;
tBox.PrintDagEntry(LL,p);
LL << ":\n";
}
#ifdef TMP_CACHE_DEBUG
std::cerr << " building cache for " << p << "...";
#endif
bool sat = runSat(p);
#ifdef TMP_CACHE_DEBUG
std::cerr << " done";
#endif
// unsat => P -> \bot
if ( !sat && LLM.isWritable(llAlways) )
LL << "\nDAG entry " << p << " is unsatisfiable\n";
return buildCacheByCGraph(sat);
}
|
