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
|
/* 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 "globaldef.h"
#ifdef RKG_USE_SORTED_REASONING
#include "RoleMaster.h"
#include "dlDag.h"
#include "logging.h"
/// merge label of given role and all its super-roles
void TRole :: mergeSupersDomain ( void )
{
for ( const_iterator p = begin_anc(), p_end = end_anc(); p != p_end; ++p )
domLabel.merge((*p)->domLabel);
// for reflexive role -- merge domain and range labels
if ( isReflexive() )
domLabel.merge(getRangeLabel());
// for R1*R2*...*Rn [= R, merge dom(R) with dom(R1) and ran(R) with ran(Rn)
for ( std::vector<TRoleVec>::iterator q = subCompositions.begin(), q_end = subCompositions.end(); q != q_end; ++q )
if ( !q->empty() )
{
domLabel.merge((*q->begin())->domLabel);
getRangeLabel().merge(q->back()->getRangeLabel());
}
}
/// merge sorts for a given role
void DLDag :: mergeSorts ( TRole* R )
{
// associate role domain labels
R->mergeSupersDomain();
merge ( R->getDomainLabel(), R->getBPDomain() );
// also associate functional nodes (if any)
for ( TRole::const_iterator q = R->begin_topfunc(), q_end = R->end_topfunc(); q != q_end; ++q )
merge ( R->getDomainLabel(), (*q)->getFunctional() );
}
/// merge sorts for a given vertex
void DLDag :: mergeSorts ( DLVertex& v )
{
switch ( v.Type() )
{
case dtLE: // set R&D for role
case dtForall:
v.merge(const_cast<TRole*>(v.getRole())->getDomainLabel()); // domain(role)=cur
merge ( const_cast<TRole*>(v.getRole())->getRangeLabel(), v.getC() );
break;
case dtProj: // projection: equate R&D of R and ProjR, and D(R) with C
v.merge(const_cast<TRole*>(v.getRole())->getDomainLabel());
v.merge(const_cast<TRole*>(v.getProjRole())->getDomainLabel());
merge ( const_cast<TRole*>(v.getRole())->getDomainLabel(), v.getC() );
const_cast<TRole*>(v.getRole())->getRangeLabel().merge(const_cast<TRole*>(v.getProjRole())->getRangeLabel());
break;
case dtIrr: // equate R&D for role
v.merge(const_cast<TRole*>(v.getRole())->getDomainLabel());
v.merge(const_cast<TRole*>(v.getRole())->getRangeLabel());
break;
case dtAnd:
for ( DLVertex::const_iterator q = v.begin(), q_end = v.end(); q < q_end; ++q )
merge ( v.getSort(), *q );
break;
case dtNSingleton:
case dtPSingleton:
case dtPConcept:
case dtNConcept: // merge with description
case dtChoose:
merge ( v.getSort(), v.getC() );
break;
case dtDataType: // nothing to do
case dtDataValue:
case dtDataExpr:
case dtNN:
break;
case dtTop:
default:
fpp_unreachable();
}
}
/// build the sort system for given TBox
void DLDag :: determineSorts ( RoleMaster& ORM, RoleMaster& DRM )
{
sortArraySize = Heap.size();
RoleMaster::iterator p, p_end;
HeapType::iterator i, i_end = Heap.end();
// init roles R&D sorts
for ( p = ORM.begin(), p_end = ORM.end(); p < p_end; ++p )
if ( !(*p)->isSynonym() )
mergeSorts(*p);
for ( p = DRM.begin(), p_end = DRM.end(); p < p_end; ++p )
if ( !(*p)->isSynonym() )
mergeSorts(*p);
for ( i = Heap.begin()+2; i < i_end; ++i )
mergeSorts(**i);
unsigned int sum = 0;
for ( i = Heap.begin()+2; i < i_end; ++i )
{
mergableLabel& lab = (*i)->getSort();
lab.resolve();
if ( lab.isSample() )
++sum;
}
for ( p = ORM.begin(), p_end = ORM.end(); p < p_end; ++p )
if ( !(*p)->isSynonym() )
{
mergableLabel& lab = const_cast<TRole*>(*p)->getDomainLabel();
lab.resolve();
if ( lab.isSample() )
++sum;
}
for ( p = DRM.begin(), p_end = DRM.end(); p < p_end; ++p )
if ( !(*p)->isSynonym() )
{
mergableLabel& lab = const_cast<TRole*>(*p)->getDomainLabel();
lab.resolve();
if ( lab.isSample() )
++sum;
}
CHECK_LL_RETURN(llAlways);
// we added a temp concept here; don't count it
if ( sum > 0 )
sum--;
LL << "\nThere are ";
if ( sum > 1 )
LL << sum;
else
LL << "no";
LL << " different sorts in TBox\n";
}
#endif // RKG_USE_SORTED_REASONING
|
