diff options
author | Oszkar Semerath <semerath@mit.bme.hu> | 2020-05-14 22:55:31 +0200 |
---|---|---|
committer | Oszkar Semerath <semerath@mit.bme.hu> | 2020-05-14 22:55:31 +0200 |
commit | 6d5b1d25c162f105a2ba1f5019574943d4a3c0e0 (patch) | |
tree | d2a333650e454649501f4104690a026495a31a0a /Solvers/VIATRA-Solver/hu.bme.mit.inf.dslreasoner.viatrasolver.logic2viatra/src/hu/bme/mit/inf/dslreasoner/viatrasolver/logic2viatra/patterns | |
parent | Merge branch 'master' of https://github.com/viatra/VIATRA-Generator (diff) | |
download | VIATRA-Generator-6d5b1d25c162f105a2ba1f5019574943d4a3c0e0.tar.gz VIATRA-Generator-6d5b1d25c162f105a2ba1f5019574943d4a3c0e0.tar.zst VIATRA-Generator-6d5b1d25c162f105a2ba1f5019574943d4a3c0e0.zip |
fixes for the measurement
Diffstat (limited to 'Solvers/VIATRA-Solver/hu.bme.mit.inf.dslreasoner.viatrasolver.logic2viatra/src/hu/bme/mit/inf/dslreasoner/viatrasolver/logic2viatra/patterns')
-rw-r--r-- | Solvers/VIATRA-Solver/hu.bme.mit.inf.dslreasoner.viatrasolver.logic2viatra/src/hu/bme/mit/inf/dslreasoner/viatrasolver/logic2viatra/patterns/PatternGenerator.xtend | 114 |
1 files changed, 57 insertions, 57 deletions
diff --git a/Solvers/VIATRA-Solver/hu.bme.mit.inf.dslreasoner.viatrasolver.logic2viatra/src/hu/bme/mit/inf/dslreasoner/viatrasolver/logic2viatra/patterns/PatternGenerator.xtend b/Solvers/VIATRA-Solver/hu.bme.mit.inf.dslreasoner.viatrasolver.logic2viatra/src/hu/bme/mit/inf/dslreasoner/viatrasolver/logic2viatra/patterns/PatternGenerator.xtend index d92f2e30..677170b8 100644 --- a/Solvers/VIATRA-Solver/hu.bme.mit.inf.dslreasoner.viatrasolver.logic2viatra/src/hu/bme/mit/inf/dslreasoner/viatrasolver/logic2viatra/patterns/PatternGenerator.xtend +++ b/Solvers/VIATRA-Solver/hu.bme.mit.inf.dslreasoner.viatrasolver.logic2viatra/src/hu/bme/mit/inf/dslreasoner/viatrasolver/logic2viatra/patterns/PatternGenerator.xtend | |||
@@ -215,42 +215,42 @@ class PatternGenerator { | |||
215 | find mayExist(problem,interpretation,a); | 215 | find mayExist(problem,interpretation,a); |
216 | find mayExist(problem,interpretation,b); | 216 | find mayExist(problem,interpretation,b); |
217 | a == b; | 217 | a == b; |
218 | } or { | 218 | ««« } or { |
219 | find mayExist(problem,interpretation,a); | 219 | ««« find mayExist(problem,interpretation,a); |
220 | find mayExist(problem,interpretation,b); | 220 | ««« find mayExist(problem,interpretation,b); |
221 | IntegerElement(a); | 221 | ««« IntegerElement(a); |
222 | IntegerElement(b); | 222 | ««« IntegerElement(b); |
223 | PrimitiveElement.valueSet(a,false); | 223 | ««« PrimitiveElement.valueSet(a,false); |
224 | } or { | 224 | ««« } or { |
225 | find mayExist(problem,interpretation,a); | 225 | ««« find mayExist(problem,interpretation,a); |
226 | find mayExist(problem,interpretation,b); | 226 | ««« find mayExist(problem,interpretation,b); |
227 | IntegerElement(a); | 227 | ««« IntegerElement(a); |
228 | IntegerElement(b); | 228 | ««« IntegerElement(b); |
229 | PrimitiveElement.valueSet(b,false); | 229 | ««« PrimitiveElement.valueSet(b,false); |
230 | } or { | 230 | ««« } or { |
231 | find mayExist(problem,interpretation,a); | 231 | ««« find mayExist(problem,interpretation,a); |
232 | find mayExist(problem,interpretation,b); | 232 | ««« find mayExist(problem,interpretation,b); |
233 | RealElement(a); | 233 | ««« RealElement(a); |
234 | RealElement(b); | 234 | ««« RealElement(b); |
235 | PrimitiveElement.valueSet(a,false); | 235 | ««« PrimitiveElement.valueSet(a,false); |
236 | } or { | 236 | ««« } or { |
237 | find mayExist(problem,interpretation,a); | 237 | ««« find mayExist(problem,interpretation,a); |
238 | find mayExist(problem,interpretation,b); | 238 | ««« find mayExist(problem,interpretation,b); |
239 | RealElement(a); | 239 | ««« RealElement(a); |
240 | RealElement(b); | 240 | ««« RealElement(b); |
241 | PrimitiveElement.valueSet(b,false); | 241 | ««« PrimitiveElement.valueSet(b,false); |
242 | } or { | 242 | ««« } or { |
243 | find mayExist(problem,interpretation,a); | 243 | ««« find mayExist(problem,interpretation,a); |
244 | find mayExist(problem,interpretation,b); | 244 | ««« find mayExist(problem,interpretation,b); |
245 | StringElement(a); | 245 | ««« StringElement(a); |
246 | StringElement(b); | 246 | ««« StringElement(b); |
247 | PrimitiveElement.valueSet(a,false); | 247 | ««« PrimitiveElement.valueSet(a,false); |
248 | } or { | 248 | ««« } or { |
249 | find mayExist(problem,interpretation,a); | 249 | ««« find mayExist(problem,interpretation,a); |
250 | find mayExist(problem,interpretation,b); | 250 | ««« find mayExist(problem,interpretation,b); |
251 | StringElement(a); | 251 | ««« StringElement(a); |
252 | StringElement(b); | 252 | ««« StringElement(b); |
253 | PrimitiveElement.valueSet(b,false); | 253 | ««« PrimitiveElement.valueSet(b,false); |
254 | } | 254 | } |
255 | 255 | ||
256 | pattern mustEquivalent(problem:LogicProblem, interpretation:PartialInterpretation, a: DefinedElement, b: DefinedElement) { | 256 | pattern mustEquivalent(problem:LogicProblem, interpretation:PartialInterpretation, a: DefinedElement, b: DefinedElement) { |
@@ -258,27 +258,27 @@ class PatternGenerator { | |||
258 | find mustExist(problem,interpretation,a); | 258 | find mustExist(problem,interpretation,a); |
259 | find mustExist(problem,interpretation,b); | 259 | find mustExist(problem,interpretation,b); |
260 | a == b; | 260 | a == b; |
261 | } or { | 261 | ««« } or { |
262 | find mustExist(problem,interpretation,a); | 262 | ««« find mustExist(problem,interpretation,a); |
263 | find mustExist(problem,interpretation,b); | 263 | ««« find mustExist(problem,interpretation,b); |
264 | PrimitiveElement.valueSet(a,true); | 264 | ««« PrimitiveElement.valueSet(a,true); |
265 | PrimitiveElement.valueSet(b,true); | 265 | ««« PrimitiveElement.valueSet(b,true); |
266 | IntegerElement.value(a,value); | 266 | ««« IntegerElement.value(a,value); |
267 | IntegerElement.value(b,value); | 267 | ««« IntegerElement.value(b,value); |
268 | } or { | 268 | ««« } or { |
269 | find mustExist(problem,interpretation,a); | 269 | ««« find mustExist(problem,interpretation,a); |
270 | find mustExist(problem,interpretation,b); | 270 | ««« find mustExist(problem,interpretation,b); |
271 | PrimitiveElement.valueSet(a,true); | 271 | ««« PrimitiveElement.valueSet(a,true); |
272 | PrimitiveElement.valueSet(b,true); | 272 | ««« PrimitiveElement.valueSet(b,true); |
273 | RealElement.value(a,value); | 273 | ««« RealElement.value(a,value); |
274 | RealElement.value(b,value); | 274 | ««« RealElement.value(b,value); |
275 | } or { | 275 | ««« } or { |
276 | find mustExist(problem,interpretation,a); | 276 | ««« find mustExist(problem,interpretation,a); |
277 | find mustExist(problem,interpretation,b); | 277 | ««« find mustExist(problem,interpretation,b); |
278 | PrimitiveElement.valueSet(a,true); | 278 | ««« PrimitiveElement.valueSet(a,true); |
279 | PrimitiveElement.valueSet(b,true); | 279 | ««« PrimitiveElement.valueSet(b,true); |
280 | StringElement.value(a,value); | 280 | ««« StringElement.value(a,value); |
281 | StringElement.value(b,value); | 281 | ««« StringElement.value(b,value); |
282 | } | 282 | } |
283 | 283 | ||
284 | ////////// | 284 | ////////// |