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
|
/* 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 "tAxiomSet.h"
#include "logging.h"
#include "dlTBox.h"
/// d'tor
TAxiomSet :: ~TAxiomSet ( void )
{
for ( AxiomCollection::iterator p = Accum.begin(), p_end = Accum.end(); p < p_end; ++p )
delete *p;
}
bool
TAxiomSet :: split ( const TAxiom* p )
{
AxiomCollection Splitted, Kept, Unneeded;
if ( !p->split(Splitted) ) // nothing to split
return false;
AxiomCollection::iterator q = Splitted.begin(), q_end = Splitted.end();
bool fail = false;
for ( ; q != q_end; ++q )
{
// axiom is a copy of a processed one: fail to do split
if ( (*q)->isCyclic() )
{
fail = true;
break;
}
// axiom is a copy of a new one: skip it
if ( copyOfExisting(*q) )
Unneeded.push_back(*q);
else // new axiom: keep it
Kept.push_back(*q);
}
// if fail to split: delete all the axioms
if ( fail )
{
for ( q = Splitted.begin(); q != q_end; ++q )
delete *q;
return false;
}
// no failure: delete all the unneded axioms, add all kept ones
for ( q = Unneeded.begin(), q_end = Unneeded.end(); q != q_end; ++q )
delete *q;
for ( q = Kept.begin(), q_end = Kept.end(); q != q_end; ++q )
insertGCI(*q);
return true;
}
size_t TAxiomSet :: absorb ( void )
{
// absorbed- and unabsorbable GCIs
AxiomCollection Absorbed, GCIs;
// we will change Accum (via split rule), so indexing and compare with size
for ( size_t curAxiom = 0; curAxiom < Accum.size(); ++curAxiom )
{
# ifdef RKG_DEBUG_ABSORPTION
std::cout << "\nProcessing (" << curAxiom << "):";
# endif
TAxiom* ax = Accum[curAxiom];
if ( absorbGCI(ax) )
Absorbed.push_back(ax);
else
GCIs.push_back(ax);
}
// clear absorbed and remove them from Accum
for ( AxiomCollection::iterator p = Absorbed.begin(), p_end = Absorbed.end(); p != p_end; ++p )
delete *p;
Accum.swap(GCIs);
#ifdef RKG_DEBUG_ABSORPTION
std::cout << "\nAbsorption done with " << Accum.size() << " GCIs left\n";
#endif
PrintStatistics();
return size();
}
bool TAxiomSet :: absorbGCI ( const TAxiom* p )
{
Stat::SAbsAction();
for ( AbsActVector::iterator f = ActionVector.begin(), f_end = ActionVector.end(); f != f_end; ++f )
if ( (this->*(*f))(p) )
return true;
#ifdef RKG_DEBUG_ABSORPTION
std::cout << " keep as GCI";
#endif
return false;
}
bool TAxiomSet :: initAbsorptionFlags ( const std::string& flags )
{
ActionVector.clear();
for ( std::string::const_iterator p = flags.begin(), p_end = flags.end(); p != p_end; ++p )
switch ( *p )
{
case 'B': ActionVector.push_back(&TAxiomSet::absorbIntoBottom); break;
case 'T': ActionVector.push_back(&TAxiomSet::absorbIntoTop); break;
case 'E': ActionVector.push_back(&TAxiomSet::simplifyCN); break;
case 'C': ActionVector.push_back(&TAxiomSet::absorbIntoConcept); break;
case 'N': ActionVector.push_back(&TAxiomSet::absorbIntoNegConcept); break;
case 'f': ActionVector.push_back(&TAxiomSet::simplifySForall); break;
case 'F': ActionVector.push_back(&TAxiomSet::simplifyForall); break;
case 'R': ActionVector.push_back(&TAxiomSet::absorbIntoDomain); break;
case 'S': ActionVector.push_back(&TAxiomSet::split); break;
default: return true;
}
if ( LLM.isWritable(llAlways) )
LL << "Init absorption order as " << flags.c_str() << "\n";
return false;
}
void TAxiomSet :: PrintStatistics ( void ) const
{
if ( Stat::SAbsAction::objects_created == 0 || !LLM.isWritable(llAlways) )
return;
LL << "\nAbsorption dealt with "
<< Stat::SAbsInput::objects_created << " input axioms\nThere were made "
<< Stat::SAbsAction::objects_created << " absorption actions, of which:";
if ( Stat::SAbsRepCN::objects_created )
LL << "\n\t" << Stat::SAbsRepCN::objects_created << " concept name replacements";
if ( Stat::SAbsRepForall::objects_created )
LL << "\n\t" << Stat::SAbsRepForall::objects_created << " universals replacements";
if ( Stat::SAbsSplit::objects_created )
LL << "\n\t" << Stat::SAbsSplit::objects_created << " conjunction splits";
if ( Stat::SAbsBApply::objects_created )
LL << "\n\t" << Stat::SAbsBApply::objects_created << " BOTTOM absorptions";
if ( Stat::SAbsTApply::objects_created )
LL << "\n\t" << Stat::SAbsTApply::objects_created << " TOP absorptions";
if ( Stat::SAbsCApply::objects_created )
LL << "\n\t" << Stat::SAbsCApply::objects_created << " concept absorption with "
<< Stat::SAbsCAttempt::objects_created << " possibilities";
if ( Stat::SAbsNApply::objects_created )
LL << "\n\t" << Stat::SAbsNApply::objects_created << " negated concept absorption with "
<< Stat::SAbsNAttempt::objects_created << " possibilities";
if ( Stat::SAbsRApply::objects_created )
LL << "\n\t" << Stat::SAbsRApply::objects_created << " role domain absorption with "
<< Stat::SAbsRAttempt::objects_created << " possibilities";
if ( !Accum.empty() )
LL << "\nThere are " << Accum.size() << " GCIs left";
}
|
