diff options
| author |  Kristóf Marussy <marussy@mit.bme.hu> | 2020-06-30 17:58:37 +0200 |
|---|---|---|
| committer | Kristóf Marussy <marussy@mit.bme.hu> | 2020-06-30 18:01:22 +0200 |
| commit | d8b56feaf72c1a9cb402c1cb4dc0c893df86bcc0 (patch) | |
| tree | 70b3b303b99a3dae5bc200656a641be85aa32b66 /Solvers/VIATRA-Solver/hu.bme.mit.inf.dslreasoner.viatrasolver.logic2viatra/src/hu/bme/mit/inf/dslreasoner/viatrasolver/logic2viatra | |
| parent | Fix scope + numerical solver interaction (diff) | |
| download | VIATRA-Generator-d8b56feaf72c1a9cb402c1cb4dc0c893df86bcc0.tar.gz VIATRA-Generator-d8b56feaf72c1a9cb402c1cb4dc0c893df86bcc0.tar.zst VIATRA-Generator-d8b56feaf72c1a9cb402c1cb4dc0c893df86bcc0.zip | |
Disable unrepairable match scoping for now
Diffstat (limited to 'Solvers/VIATRA-Solver/hu.bme.mit.inf.dslreasoner.viatrasolver.logic2viatra/src/hu/bme/mit/inf/dslreasoner/viatrasolver/logic2viatra')
| -rw-r--r-- | Solvers/VIATRA-Solver/hu.bme.mit.inf.dslreasoner.viatrasolver.logic2viatra/src/hu/bme/mit/inf/dslreasoner/viatrasolver/logic2viatra/cardinality/RelationConstraintCalculator.xtend | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/Solvers/VIATRA-Solver/hu.bme.mit.inf.dslreasoner.viatrasolver.logic2viatra/src/hu/bme/mit/inf/dslreasoner/viatrasolver/logic2viatra/cardinality/RelationConstraintCalculator.xtend b/Solvers/VIATRA-Solver/hu.bme.mit.inf.dslreasoner.viatrasolver.logic2viatra/src/hu/bme/mit/inf/dslreasoner/viatrasolver/logic2viatra/cardinality/RelationConstraintCalculator.xtend index 7fec452f..abf65be3 100644 --- a/Solvers/VIATRA-Solver/hu.bme.mit.inf.dslreasoner.viatrasolver.logic2viatra/src/hu/bme/mit/inf/dslreasoner/viatrasolver/logic2viatra/cardinality/RelationConstraintCalculator.xtend +++ b/Solvers/VIATRA-Solver/hu.bme.mit.inf.dslreasoner.viatrasolver.logic2viatra/src/hu/bme/mit/inf/dslreasoner/viatrasolver/logic2viatra/cardinality/RelationConstraintCalculator.xtend | |||
| @@ -46,7 +46,7 @@ class RelationMultiplicityConstraint { | |||
| 46 | def constrainsUnrepairable() { | 46 | def constrainsUnrepairable() { |
| 47 | // TODO Optimize the unrepairable matches computation, | 47 | // TODO Optimize the unrepairable matches computation, |
| 48 | // or come up with a heuristic when does computing unrepairables worth the overhead. | 48 | // or come up with a heuristic when does computing unrepairables worth the overhead. |
| 49 | constrainsUnfinished && canHaveMultipleSourcesPerTarget && reference | 49 | false && constrainsUnfinished && canHaveMultipleSourcesPerTarget && reference |
| 50 | } | 50 | } |
| 51 | 51 | ||
| 52 | def constrainsRemainingInverse() { | 52 | def constrainsRemainingInverse() { |