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
|
/* 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 "LogicFeature.h"
#include "logging.h"
#include "dlVertex.h"
#include "tConcept.h"
#include "tRole.h"
void LogicFeatures :: fillConceptData ( const TConcept* p )
{
if ( p->isSingleton() )
setX(lfSingleton);
}
void LogicFeatures :: fillRoleData ( const TRole* p, bool both )
{
if ( unlikely(p->isTop()) )
{
if ( !p->isDataRole() )
setX(lfTopRole);
return;
}
if ( p->getId() > 0 ) // direct role
setX(lfDirectRoles);
else
setX(lfInverseRoles);
// inverse roles check
if ( both )
setX(lfBothRoles);
// transitivity check
if ( p->isTransitive() )
setX(lfTransitiveRoles);
// subsumption check
if ( p->hasToldSubsumers() )
setX(lfRolesSubsumption);
// functionality check
if ( p->isFunctional() )
setX(lfFunctionalRoles);
// R&D check
if ( p->getBPDomain() != bpTOP || p->getBPRange() != bpTOP )
setX(lfRangeAndDomain);
}
void LogicFeatures :: fillDAGData ( const DLVertex& v, bool )
{
switch ( v.Type () )
{
case dtForall:
setX(lfSomeConstructor);
break;
case dtLE:
setX(lfNConstructor);
if ( v.getC() != bpTOP )
setX(lfQConstructor);
break;
case dtPSingleton:
case dtNSingleton:
setX(lfSingleton);
break;
case dtIrr:
setX(lfSelfRef);
break;
default: // any other vertex -- nothing to do
break;
}
}
void LogicFeatures :: writeState ( void ) const
{
CHECK_LL_RETURN(llAlways);
LL << "\nLoaded KB used DL with following features:\nKB contains ";
if ( !hasInverseRole () )
LL << "NO ";
LL << "inverse role(s)\nKB contains ";
if ( !hasRoleHierarchy () )
LL << "NO ";
LL << "role hierarchy\nKB contains ";
if ( !hasTransitiveRole () )
LL << "NO ";
LL << "transitive role(s)\nKB contains ";
if ( !hasTopRole () )
LL << "NO ";
LL << "top role expressions\nKB contains ";
if ( !hasSomeAll () )
LL << "NO ";
LL << "quanitifier(s)\nKB contains ";
if ( !hasFunctionalRestriction () )
LL << "NO ";
LL << "functional restriction(s)\nKB contains ";
if ( !hasNumberRestriction () )
LL << "NO ";
else if ( hasQNumberRestriction () )
LL << "qualified ";
LL << "number restriction(s)\nKB contains ";
if ( !hasSingletons() )
LL << "NO ";
LL << "nominal(s)\n";
}
|
