[PPL-devel] integer versus rational solutions

[Konrad Trifunovic]

Thank You for Your work,

indeed, when changed to C_Polyhedron this example was solved quickly.
It made me think that changing all the polyhedrons to C_Polyhedron would
solve the problems, unfortunately I have found some other examples that take
a long time, even when being expressed as C_Polyhedrons. Stay tuned, I will send
an examples.

Thanks,
Konrad

2009/7/10 Enea Zaffanella <zaffanella at cs.unipr.it>:
> Enea Zaffanella wrote:
>>
>> Konrad Trifunovic wrote:
>>>
>>> Hi all,
>>>
>>> the other tip that I give: if I try to resolve the same polyhedron,
>>> but if I make it Closed Polyhedron, then the solver
>>> 'contains_integer_point'
>>> runs out of memory.
>>>
>>> Konrad
>>
>> Hello.
>>
>> We made a quick test using your data (the higher dimension data).
>
> I just saw that I made a mistake in the test ...
>
> I haven't noticed that the input test was actually containing a strict
> inequality constraint ... so I was "over-approximating" it using a
> non-strict inequality (when converting the NNC to the C polyhedron).
>
> I will investigate further.
>
> Enea.
>