[PPL-devel] PPL for linear expression comparison and constraint derivation

[Aleksandra Jovanovic]

Dear Professor,

Thank you very much, this indeed seems to be exactly what I needed. 
I am sorry for the late reply I am attending a conference at the moment.

Thank you once again,

Aleksandra Jovanovic


Aleksandra Jovanovic
Research Assistant
Department of Computer Science
University of Oxford
Wolfson Building, Parks Road
Oxford, OX1 3QD


On 19 Sep 2014, at 19:13, Roberto Bagnara <bagnara at cs.unipr.it> wrote:

> #include <ppl.hh>
> 
> using namespace std;
> using namespace Parma_Polyhedra_Library;
> using namespace Parma_Polyhedra_Library::IO_Operators;
> 
> int main() {
>  NNC_Polyhedron ph(3);
>  Variable A(0);
>  Variable B(1);
>  Variable C(2);
>  ph.add_constraint(3*A + B + 5*C < A + 5*B + 3*C);
>  cout << ph.minimized_constraints() << endl;
>  return 0;
> }

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.cs.unipr.it/pipermail/ppl-devel/attachments/20140922/701b40df/attachment.htm>