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
|
/* 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 "dumpLisp.h"
void dumpLisp :: startOp ( diOp Op )
{
if ( Op == diAnd || Op == diOr )
incIndent();
o << "(";
switch (Op)
{
case diErrorOp:
default:
fpp_unreachable();
// concept expressions
case diNot:
o << "not";
break;
case diAnd:
o << "and";
break;
case diOr:
o << "or";
break;
case diExists:
o << "some";
break;
case diForall:
o << "all";
break;
case diGE:
o << "atleast";
break;
case diLE:
o << "atmost";
break;
}
contOp(Op);
}
void dumpLisp :: startAx ( diAx Ax )
{
o << "(";
switch (Ax)
{
case diErrorAx:
default:
fpp_unreachable();
// concept axioms
case diDefineC:
o << "defprimconcept";
break;
case diImpliesC:
o << "implies_c";
break;
case diEqualsC:
o << "equal_c";
break;
// role axioms
case diDefineR:
o << "defprimrole";
break;
case diTransitiveR:
o << "transitive";
break;
case diFunctionalR:
o << "functional";
break;
case diImpliesR:
o << "implies_r";
break;
case diEqualsR:
o << "equal_r";
break;
case diDomainR:
o << "domain";
break;
case diRangeR:
o << "range";
break;
};
contAx(Ax);
}
|
