-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathAtom.cpp
335 lines (284 loc) · 9.33 KB
/
Atom.cpp
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
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
/***************************************************************************
* Copyright (C) 2014 by Mushthofa *
* Mushthofa.Mushthofa@Ugent.be *
* *
* 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, Inc., *
* 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *
***************************************************************************/
/**
* @file Atom.cpp
* @author Roman Schindlauer, Mushthofa
*
*
* @brief Atom class definition
*
*
*/
#include "Atom.h"
/* Initialize static data member */
std::set<Term> Atom::constantsTable;
std::set<int> ConstantAtom::denomList;
Atom::Atom()
:isStrongNegated(false)
{
}
Atom::~Atom()
{
}
Atom::Atom(const Atom& atom2)
:arguments(atom2.arguments),
isStrongNegated(atom2.isStrongNegated)
{
}
Atom::Atom(const std::string& predname, const Tuple& args, bool neg)
:isStrongNegated(neg)
{
arguments.push_back(Term(predname, Term::SYMBOL));
Tuple::const_iterator args_it;
for(args_it=args.begin(); args_it!=args.end(); ++args_it)
{
arguments.push_back(*args_it);
/* Store constants in the table */
if(args_it->isConstant())
constantsTable.insert(*args_it);
}
}
Atom::Atom(const Tuple& args, bool neg)
:isStrongNegated(neg)
{
assert(args.size()>0);
Tuple::const_iterator args_it;
bool is_arg = false;
for(args_it=args.begin(); args_it!=args.end(); ++args_it)
{
if(!is_arg) /* First time is always true, then always false */
{
is_arg = true;
}
else
{
/* Store constants in the table */
if(args_it->isConstant())
constantsTable.insert(*args_it);
}
arguments.push_back(*args_it);
}
}
void Atom::setArguments(const Tuple& args)
{
arguments.resize(1);
arguments.insert(arguments.end(),
args.begin(), args.end());
}
const Term& Atom::getArgument(unsigned idx) const
{
return arguments[idx];
}
std::string Atom::getPredicateName() const
{
Term predTerm = getArgument(0);
return predTerm.getName();
}
unsigned Atom::getArity() const
{
return arguments.size()-1;
}
const Term& Atom::getPredicate() const
{
return getArgument(0);
}
bool Atom::isStronglyNegated() const
{
return isStrongNegated;
}
bool Atom::unifiesWith(const AtomPtr& atom2) const
{
if(typeid(*atom2)!=typeid(Atom))
return false;
if(getArity()!=atom2->getArity())
return false;
for(unsigned i=0; i<=getArity(); i++)
{
if(!getArgument(i).unifiesWith(atom2->getArgument(i)))
return false;
}
return true;
}
/*
void Atom::accept(BaseVisitor& v) const
{
v.visitAtom(this);
}
*/
bool Atom::operator==(const Atom& atom2) const
{
if(typeid(atom2)!=typeid(*this))
return false;
if(getArity()!=atom2.getArity())
return false;
if(isStrongNegated!=atom2.isStronglyNegated())
return false;
return equal(this->arguments.begin(), this->arguments.end(),
atom2.arguments.begin());
}
bool Atom::operator!=(const Atom& atom2) const
{
return !(*this==atom2);
}
bool Atom::operator<(const Atom& atom2) const
{
/* If both is infix/constant atom, we do lexicographical compare */
if(typeid(*this) == typeid(ConstantAtom) && typeid(atom2) == typeid(ConstantAtom))
{
return this->getRat() < atom2.getRat();
}
if(typeid(*this) == typeid(InfixAtom) && typeid(atom2) == typeid(InfixAtom))
return std::lexicographical_compare(arguments.begin(), arguments.end(),
atom2.arguments.begin(), atom2.arguments.end());
/* Constant > InfixAtom > Normal */
if(typeid(*this) == typeid(ConstantAtom) && typeid(atom2) == typeid(InfixAtom))
return false;
if(typeid(*this) == typeid(InfixAtom) && typeid(atom2) == typeid(ConstantAtom))
return true;
if(typeid(*this) == typeid(ConstantAtom) && typeid(atom2) == typeid(Atom))
return false;
if(typeid(*this) == typeid(Atom) && typeid(atom2) == typeid(ConstantAtom))
return true;
if(typeid(*this) == typeid(InfixAtom) && typeid(atom2) == typeid(Atom))
return true;
if(typeid(*this) == typeid(Atom) && typeid(atom2) == typeid(InfixAtom))
return false;
int n = getPredicate().compare(atom2.getPredicate());
if(n<0)
return true;
if(n>0)
return false;
if (!isStrongNegated && atom2.isStrongNegated)
return true;
else if (isStrongNegated && !atom2.isStrongNegated)
return false;
if (getArity() < atom2.getArity())
{
return true;
}
if (getArity() == atom2.getArity())
{
return std::lexicographical_compare(++arguments.begin(), arguments.end(),
++atom2.arguments.begin(), atom2.arguments.end());
}
// getArity() > atom2.getArity()
return false;
}
bool Atom::operator>(const Atom& atom2) const
{
return (!(*this==atom2) && !(*this<atom2));
}
bool Atom::operator<=(const Atom& atom2) const
{
return !(*this>atom2);
}
bool Atom::operator>=(const Atom& atom2) const
{
return !(*this<atom2);
}
bool Atom::isGround() const
{
for(Tuple::const_iterator it=arguments.begin(); it!=arguments.end(); ++it)
{
if(it->isVariable())
return false;
}
return true;
}
std::set<std::string> Atom::getVariables() const
{
std::set<std::string> vars;
for(Tuple::const_iterator args_it = arguments.begin();
args_it!=arguments.end();
++args_it)
{
if(args_it->isVariable())
vars.insert(args_it->getVariable());
}
return vars;
}
std::ostream& operator<<(std::ostream& os, const Atom& atom)
{
if(typeid(atom)==typeid(ConstantAtom)) /* Bad use of typeid */
{
os<<"#"<<atom.getRat();
}
else if(typeid(atom)==typeid(InfixAtom))
{
Tuple args = atom.getArguments();
std::string op = atom.getPredicateName();
os << args[0] << op << args[1];
}
else
{
unsigned i=1;
if(atom.isStronglyNegated())
os<<"-";
os<<atom.getPredicate();
Tuple args = atom.getArguments();
if(args.size()>0)
{
os<<"(";
for(Tuple::const_iterator it=args.begin(); it!=args.end(); ++it)
{
os<<*it;
if(i++<atom.getArguments().size())
os<<", ";
}
os<<")";
}
}
return os;
}
std::ostream& operator<<(std::ostream& os, const Rational& r)
{
os<<r.getNom()<<"/"<<r.getDenom();
//os<<r.getFloat();
return os;
}
bool operator<(const AtomPtr& a, const AtomPtr& b)
{
return *a<*b;
}
InfixAtom::InfixAtom( const std::string& op, Term& t1, Term& t2)
{
arguments.clear();
arguments.push_back(Term(op, Term::SYMBOL));
arguments.push_back(t1);
arguments.push_back(t2);
if(t1.isConstant())
constantsTable.insert(t1);
if(t2.isConstant())
constantsTable.insert(t2);
}
/*
void InfixAtom::accept(BaseVisitor& v) const
{
v.visitInfixAtom(this);
}
std::ostream& operator<<(std::ostream& os, const InfixAtom& atom)
{
os<<atom.getArgument(1);
os<<atom.getArgument(0);
os<<atom.getArgument(2);
return os;
}
*/
//End