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
|
/* 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 program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License
as published by the Free Software Foundation; either version 2
of the License, or (at your option) any later version.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
#include "ReasonerNom.h"
//-----------------------------------------------------------------------------
//-- internal nominal reasoning interface
//-----------------------------------------------------------------------------
// register all nominals defined in TBox
void
NominalReasoner :: initNominalVector ( void )
{
Nominals.clear();
for ( TBox::i_iterator pi = tBox.i_begin(); pi != tBox.i_end(); ++pi )
if ( !(*pi)->isSynonym() )
Nominals.push_back(*pi);
}
/// prerpare Nominal Reasoner to a new job
void
NominalReasoner :: prepareReasoner ( void )
{
if ( LLM.isWritable(llSRState) )
LL << "\nInitNominalReasoner:";
restore(1);
// check whether branching op is not a barrier...
if ( dynamic_cast<BCBarrier*>(bContext) == NULL )
{ // replace it with a barrier
Stack.pop();
createBCBarrier();
}
// save the barrier (also remember the entry to be produced)
save();
// free the memory used in the pools before
Stack.clearPools();
// clear last session information
resetSessionFlags();
}
bool
NominalReasoner :: consistentNominalCloud ( void )
{
if ( LLM.isWritable(llBegSat) )
LL << "\n--------------------------------------------\n"
"Checking consistency of an ontology with individuals:";
if ( LLM.isWritable(llGTA) )
LL << "\n";
bool result = false;
// reserve the root for the forthcoming reasoning
if ( initNewNode ( CGraph.getRoot(), DepSet(), bpTOP ) ||
initNominalCloud() ) // clash during initialisation
result = false;
else // perform a normal reasoning
result = runSat();
if ( result && noBranchingOps() )
{ // all nominal cloud is classified w/o branching -- make a barrier
if ( LLM.isWritable(llSRState) )
LL << "InitNominalReasoner[";
curNode = NULL;
createBCBarrier();
save();
nonDetShift = 1; // the barrier doesn't introduce branching itself
if ( LLM.isWritable(llSRState) )
LL << "]";
}
if ( LLM.isWritable(llSatResult) )
LL << "\nThe ontology is " << (result ? "consistent" : "INCONSISTENT");
if ( !result )
return false;
// ABox is consistent -> create cache for every nominal in KB
for ( SingletonVector::iterator p = Nominals.begin(); p != Nominals.end(); ++p )
updateClassifiedSingleton(*p);
return true;
}
/// create nominal nodes for all individuals in TBox
bool
NominalReasoner :: initNominalCloud ( void )
{
// create nominal nodes and fills them with initial values
for ( SingletonVector::iterator p = Nominals.begin(); p != Nominals.end(); ++p )
if ( initNominalNode(*p) )
return true; // ABox is inconsistent
// create edges between related nodes
for ( TBox::RelatedCollection::const_iterator q = tBox.RelatedI.begin(); q != tBox.RelatedI.end(); ++q, ++q )
if ( initRelatedNominals(*q) )
return true; // ABox is inconsistent
// create disjoint markers on nominal nodes
if ( tBox.Different.empty() )
return false;
DepSet dummy; // empty dep-set for the CGraph
for ( TBox::DifferentIndividuals::const_iterator
r = tBox.Different.begin(); r != tBox.Different.end(); ++r )
{
CGraph.initIR();
for ( SingletonVector::const_iterator p = r->begin(); p != r->end(); ++p )
if ( CGraph.setCurIR ( resolveSynonym(*p)->node, dummy ) ) // different(c,c)
return true;
CGraph.finiIR();
}
// init was OK
return false;
}
bool
NominalReasoner :: initRelatedNominals ( const TRelated* rel )
{
DlCompletionTree* from = resolveSynonym(rel->a)->node;
DlCompletionTree* to = resolveSynonym(rel->b)->node;
TRole* R = resolveSynonym(rel->R);
DepSet dep; // empty dep-set
// check if merging will lead to clash because of disjoint roles
if ( R->isDisjoint() && checkDisjointRoleClash ( from, to, R, dep ) )
return true;
// create new edge between FROM and TO
DlCompletionTreeArc* pA =
CGraph.addRoleLabel ( from, to, /*isPredEdge=*/false, R, dep );
// return OK iff setup new enge didn't lead to clash
// do NOT need to re-check anything: nothing was processed yet
return setupEdge ( pA, dep );
}
|
