choco-users Mailing List for choco

Hello there

I would greatly appreciate a small amount of your time to assist with
my doctoral research at The University of Newcastle. The research
concerns open source licensing and we're seeking developers working on
Java projects. The research is supervised, ethics-approved, anonymous
and results will be freely available. Participation will also provide a
custom licensing report for your project. To learn more, please visit:

   http://licensing-research.newcastle.edu.au

Thanks for reading this email, and I hope you'll consider participating.

Best regards
Ben Alex

(My apologies for being off-topic; this list will not be emailed again)

Le 6 juin 07 =E0 14:10, Sciss a =E9crit :

> last, i'm interested to know if anyone is using choco in a scripting
> environment on top of java, like groovy or jython.
> how senseful do you judge an effort to port the choco library to
> other languages like supercollider3?
> thanks, -sciss-

Don't know about supercollider3

I tested choco with groovy, a nice language.
But Groovy only works with java.
Ruby is another nice language (true object, ...) from witch groovy
is derived.
But ruby (as a C interpreter) come with much more libraries
and is strongly supported by sun in its JRuby version
(JRuby-1.0.0 has just come out (10 june !)

You can get it at :
	http://dist.codehaus.org/jruby/

Here is a verbose sample of a MagiScare un JRuby
(It works on
     - Mac-osx and linux
     - with jruby-1.0
     - with choco-cvs-20070125.jar

The following example show how Ruby can add a method
to an existing choco class.
Operator overloading could also be usefull for specifing
constraint, but choco design seems not be very adapded
for this purpose (if IntExp interface provide
     IntExp eq(IntExp),
     ...
Then ruby would just had to add "=3D=3D" method to
the IntExp class, or somethong like that...)

Oooops,

I just realized I forgot to post the constraint.
 myPb.post(myPb.feasTupleFC(dim, result));=20
I was indeed missing something !

David

-----Message d'origine-----
De : cho...@li...
[mailto:cho...@li...] De la part de David
GRAVOT
Envoy=E9 : dimanche 10 juin 2007 14:22
=C0 : cho...@li...
Objet : [Choco-users] Newbie : feasTuple

 Hello,

I'm trying to use feasTupleFC to limit an array of three integer =
variables
to be bound to the permutations of three given different numbers =
v1<v2<v3

Using :=20

ArrayList<int[]> result =3D new ArrayList<int[]>();
		result.add(new int[]{v1,v2,v3});
		result.add(new int[]{v1,v3,v2});
		result.add(new int[]{v2,v1,v3});
		result.add(new int[]{v2,v3,v1});
		result.add(new int[]{v3,v1,v2});
		result.add(new int[]{v3,v2,v1});

And then
		myPb.feasTupleFC(dim, result);

How do I have to declare dim ? I first tried :=20
IntDomainVar[] dim =3D myPb.makeEnumIntVarArray("dims", 3, v1, v3);

But then, the possible solutions include v1,v1,v1 and in fact all the 27
combinations I then tried infeasTupleFC on the 21 wrong combinations, =
but
the result is still the same.
Note : Neither (in)feasTupleAC nor BoundVarArrat do help more

I guess I'm missing something !

Thanks for feedback

David


-------------------------------------------------------------------------=

This SF.net email is sponsored by DB2 Express Download DB2 Express C - =
the
FREE version of DB2 express and take control of your XML. No limits. =
Just
data. Click to get it now.
http://sourceforge.net/powerbar/db2/
_______________________________________________
Choco-users mailing list
Cho...@li...
https://lists.sourceforge.net/lists/listinfo/choco-users

 Hello,

I'm trying to use feasTupleFC to limit an array of three integer variables
to be bound to the permutations of three given different numbers v1<v2<v3

Using : 

ArrayList<int[]> result = new ArrayList<int[]>();
		result.add(new int[]{v1,v2,v3});
		result.add(new int[]{v1,v3,v2});
		result.add(new int[]{v2,v1,v3});
		result.add(new int[]{v2,v3,v1});
		result.add(new int[]{v3,v1,v2});
		result.add(new int[]{v3,v2,v1});

And then
		myPb.feasTupleFC(dim, result);

How do I have to declare dim ? I first tried : 
IntDomainVar[] dim = myPb.makeEnumIntVarArray("dims", 3, v1, v3);

But then, the possible solutions include v1,v1,v1 and in fact all the 27
combinations
I then tried infeasTupleFC on the 21 wrong combinations, but the result is
still the same.
Note : Neither (in)feasTupleAC nor BoundVarArrat do help more

I guess I'm missing something !

Thanks for feedback

David

Hi,

You can find more information about Palm here => 
http://www.e-constraints.net/palm/palm.html


Guillaume

Sciss a écrit :
> well, found the paper
>
> http://www.emn.fr/jussien/publications/jussien-WCP00.pdf
>
> and got choco working in groovy (groovy.codehaus.org):
>
> pb = new choco.palm.PalmProblem();
> a = pb.makeEnumIntVar( "a", 1, 15 );
> b = pb.makeEnumIntVar( "b", 1, 15 );
> c = pb.makeEnumIntVar( "c", 1, 15 );
> d = pb.makeEnumIntVar( "d", 1, 15 );
> e = pb.makeEnumIntVar( "e", 1, 15 );
> f = pb.makeEnumIntVar( "f", 1, 15 );
> pb.post( pb.geq( d, pb.plus( a, 1 )));
> pb.post( pb.geq( d, pb.plus( b, 2 )));
> pb.post( pb.geq( e ,pb.plus( c, 1 )));
> pb.post( pb.geq( f, pb.plus( d, 4 )));
> pb.post( pb.geq( f, pb.plus( e, 3 )));
> pb.propagate();
> println "result f = " + f.getDomain();
>
>
> ;-)  now trying out things.
>
> ciao, -sciss-
>
>
> Am 06.06.2007 um 16:09 schrieb Sciss:
>
>   
>> thank you! where can i find information / doc / tutorial about palm?
>>
>> ciao, -sciss-
>>
>>
>> Am 06.06.2007 um 15:51 schrieb Guillaume Richaud:
>>
>>     
>>> Hi,
>>>
>>> To answer to your first question: yes you can add constraints and
>>> remove them dynamically. But to be able to remove them without
>>> restarting you have to use Choco/Palm.
>>>
>>> Guillaume
>>>
>>> Sciss a écrit :
>>>       
>>>> hi,
>>>>
>>>> i'm starting to learn about contraint programming. i want to
>>>> evaluate  the possibilities of using choco with longterm question
>>>> about  constraints that can change in a "realtime environment", so
>>>> i'm  interested in the timing scheme of choco and if it's possible
>>>> to  calculate some variables and at some later point in time
>>>> modify  constraints (re-post them?) and re-calculate certain
>>>> variables.
>>>>
>>>> then i'm interested in what i guess is called soft constraints,
>>>> i.e.  variables that are only specified in terms of a probability
>>>> distribution so that a solution is calculated by generating a
>>>> random  number that satisfies that distribution.
>>>>
>>>> last, i'm interested to know if anyone is using choco in a
>>>> scripting  environment on top of java, like groovy or jython.
>>>>
>>>> how senseful do you judge an effort to port the choco library to
>>>> other languages like supercollider3?
>>>>
>>>> thanks, -sciss-
>>>>
>>>>         
>> ---------------------------------------------------------------------- 
>> ---
>> This SF.net email is sponsored by DB2 Express
>> Download DB2 Express C - the FREE version of DB2 express and take
>> control of your XML. No limits. Just data. Click to get it now.
>> http://sourceforge.net/powerbar/db2/
>> _______________________________________________
>> Choco-users mailing list
>> Cho...@li...
>> https://lists.sourceforge.net/lists/listinfo/choco-users
>>     
>
>
> -------------------------------------------------------------------------
> This SF.net email is sponsored by DB2 Express
> Download DB2 Express C - the FREE version of DB2 express and take
> control of your XML. No limits. Just data. Click to get it now.
> http://sourceforge.net/powerbar/db2/
> _______________________________________________
> Choco-users mailing list
> Cho...@li...
> https://lists.sourceforge.net/lists/listinfo/choco-users
>
>   

well, found the paper

http://www.emn.fr/jussien/publications/jussien-WCP00.pdf

and got choco working in groovy (groovy.codehaus.org):

pb =3D new choco.palm.PalmProblem();
a =3D pb.makeEnumIntVar( "a", 1, 15 );
b =3D pb.makeEnumIntVar( "b", 1, 15 );
c =3D pb.makeEnumIntVar( "c", 1, 15 );
d =3D pb.makeEnumIntVar( "d", 1, 15 );
e =3D pb.makeEnumIntVar( "e", 1, 15 );
f =3D pb.makeEnumIntVar( "f", 1, 15 );
pb.post( pb.geq( d, pb.plus( a, 1 )));
pb.post( pb.geq( d, pb.plus( b, 2 )));
pb.post( pb.geq( e ,pb.plus( c, 1 )));
pb.post( pb.geq( f, pb.plus( d, 4 )));
pb.post( pb.geq( f, pb.plus( e, 3 )));
pb.propagate();
println "result f =3D " + f.getDomain();


;-)  now trying out things.

ciao, -sciss-


Am 06.06.2007 um 16:09 schrieb Sciss:

> thank you! where can i find information / doc / tutorial about palm?
>
> ciao, -sciss-
>
>
> Am 06.06.2007 um 15:51 schrieb Guillaume Richaud:
>
>> Hi,
>>
>> To answer to your first question: yes you can add constraints and
>> remove them dynamically. But to be able to remove them without
>> restarting you have to use Choco/Palm.
>>
>> Guillaume
>>
>> Sciss a =E9crit :
>>> hi,
>>>
>>> i'm starting to learn about contraint programming. i want to
>>> evaluate  the possibilities of using choco with longterm question
>>> about  constraints that can change in a "realtime environment", so
>>> i'm  interested in the timing scheme of choco and if it's possible
>>> to  calculate some variables and at some later point in time
>>> modify  constraints (re-post them?) and re-calculate certain
>>> variables.
>>>
>>> then i'm interested in what i guess is called soft constraints,
>>> i.e.  variables that are only specified in terms of a probability
>>> distribution so that a solution is calculated by generating a
>>> random  number that satisfies that distribution.
>>>
>>> last, i'm interested to know if anyone is using choco in a
>>> scripting  environment on top of java, like groovy or jython.
>>>
>>> how senseful do you judge an effort to port the choco library to
>>> other languages like supercollider3?
>>>
>>> thanks, -sciss-
>>>
>
>
> ----------------------------------------------------------------------=20=

> ---
> This SF.net email is sponsored by DB2 Express
> Download DB2 Express C - the FREE version of DB2 express and take
> control of your XML. No limits. Just data. Click to get it now.
> http://sourceforge.net/powerbar/db2/
> _______________________________________________
> Choco-users mailing list
> Cho...@li...
> https://lists.sourceforge.net/lists/listinfo/choco-users

thank you! where can i find information / doc / tutorial about palm?

ciao, -sciss-


Am 06.06.2007 um 15:51 schrieb Guillaume Richaud:

> Hi,
>
> To answer to your first question: yes you can add constraints and =20
> remove them dynamically. But to be able to remove them without =20
> restarting you have to use Choco/Palm.
>
> Guillaume
>
> Sciss a =E9crit :
>> hi,
>>
>> i'm starting to learn about contraint programming. i want to =20
>> evaluate  the possibilities of using choco with longterm question =20
>> about  constraints that can change in a "realtime environment", so =20=

>> i'm  interested in the timing scheme of choco and if it's possible =20=

>> to  calculate some variables and at some later point in time =20
>> modify  constraints (re-post them?) and re-calculate certain =20
>> variables.
>>
>> then i'm interested in what i guess is called soft constraints, =20
>> i.e.  variables that are only specified in terms of a probability  =20=

>> distribution so that a solution is calculated by generating a =20
>> random  number that satisfies that distribution.
>>
>> last, i'm interested to know if anyone is using choco in a =20
>> scripting  environment on top of java, like groovy or jython.
>>
>> how senseful do you judge an effort to port the choco library to  =20
>> other languages like supercollider3?
>>
>> thanks, -sciss-
>>

Hi,

To answer to your first question: yes you can add constraints and remove 
them dynamically. But to be able to remove them without restarting you 
have to use Choco/Palm.

Guillaume

Sciss a écrit :
> hi,
>
> i'm starting to learn about contraint programming. i want to evaluate  
> the possibilities of using choco with longterm question about  
> constraints that can change in a "realtime environment", so i'm  
> interested in the timing scheme of choco and if it's possible to  
> calculate some variables and at some later point in time modify  
> constraints (re-post them?) and re-calculate certain variables.
>
> then i'm interested in what i guess is called soft constraints, i.e.  
> variables that are only specified in terms of a probability  
> distribution so that a solution is calculated by generating a random  
> number that satisfies that distribution.
>
> last, i'm interested to know if anyone is using choco in a scripting  
> environment on top of java, like groovy or jython.
>
> how senseful do you judge an effort to port the choco library to  
> other languages like supercollider3?
>
> thanks, -sciss-
>
>
> -------------------------------------------------------------------------
> This SF.net email is sponsored by DB2 Express
> Download DB2 Express C - the FREE version of DB2 express and take
> control of your XML. No limits. Just data. Click to get it now.
> http://sourceforge.net/powerbar/db2/
> _______________________________________________
> Choco-users mailing list
> Cho...@li...
> https://lists.sourceforge.net/lists/listinfo/choco-users
>
>   

Hi,

Malcolm Ryan a écrit :
> Thanks, that gives me what I need. My other question is about  
> backtracking. There is a section in the User Guide labeled  
> "backtrackable structures" but it is lacking any content. Could you  
> explain what how it works?
>
>   

There are "backtrackable variables" called StoredVar (StoredInt, 
StoredBitSet, StoredBool...).
A StoredVar works as a variable (affectation, modification...)  but all 
its previous values are stored and automatically restored upon bactracking.



> One of the things I have implemented in Eclipse is a variable length  
> list of values. It only creates variables for entries in the list as  
> they are called for (ie, as the lower bound of the length variable  
> increases). The good thing about Prolog is that it automatically  
> handles backtracking over this action. How hard would it be to do  
> something similar in Choco?
>
>   
I don't really understand your question. There aren't any methods 
available to add/remove variables dynamically. Hope it helps...


Guillaume

hi,

i'm starting to learn about contraint programming. i want to evaluate  
the possibilities of using choco with longterm question about  
constraints that can change in a "realtime environment", so i'm  
interested in the timing scheme of choco and if it's possible to  
calculate some variables and at some later point in time modify  
constraints (re-post them?) and re-calculate certain variables.

then i'm interested in what i guess is called soft constraints, i.e.  
variables that are only specified in terms of a probability  
distribution so that a solution is calculated by generating a random  
number that satisfies that distribution.

last, i'm interested to know if anyone is using choco in a scripting  
environment on top of java, like groovy or jython.

how senseful do you judge an effort to port the choco library to  
other languages like supercollider3?

thanks, -sciss-

Thanks, that gives me what I need. My other question is about =20
backtracking. There is a section in the User Guide labeled =20
"backtrackable structures" but it is lacking any content. Could you =20
explain what how it works?

One of the things I have implemented in Eclipse is a variable length =20
list of values. It only creates variables for entries in the list as =20
they are called for (ie, as the lower bound of the length variable =20
increases). The good thing about Prolog is that it automatically =20
handles backtracking over this action. How hard would it be to do =20
something similar in Choco?

Malcolm


On 05/06/2007, at 6:32 PM, Guillaume Richaud wrote:

> Hi,
>
> Yes, choco has fine-grained events (instantiation, removal, bound =20
> modification,...).
> For a small exemple on how you can use it, you can look at:  http://=20=

> choco-solver.net/index.php?title=3DDiffVec.java
>
>
> Hope it helps.
> Guillaume
>
> Malcolm Ryan a =E9crit :
>> Hi,
>>
>> I've been doing some constraint programming in ECLiPSe prolog, =20
>> but  the language is beginning to really annoy me and I've been =20
>> thinking  about migrating to a different platform. Choco looks =20
>> like a  possibility, but I need to make sure it can do the things =20
>> I need.  Eclipse has an event model whereby you can set an action =20
>> to occur  when a particular event occurs on a variable. Defined =20
>> events include  an event whenever the domain is constrained and an =20=

>> event when the  variable is instantiated. Is there an equivalent =20
>> functionality in Choco?
>>
>> Malcolm
>>
>> --
>> Many clever men like you have trusted to civilisation.
>> Many clever Babylonians, many clever Egyptians,
>> Many clever men at the end of Rome.
>>                                - G.K.Chesterton, The Napoleon of  =20
>> Notting Hill
>>
>>
>>
>>
>> ---------------------------------------------------------------------=20=

>> ----
>> This SF.net email is sponsored by DB2 Express
>> Download DB2 Express C - the FREE version of DB2 express and take
>> control of your XML. No limits. Just data. Click to get it now.
>> http://sourceforge.net/powerbar/db2/
>> _______________________________________________
>> Choco-users mailing list
>> Cho...@li...
>> https://lists.sourceforge.net/lists/listinfo/choco-users
>>
>>

--
      "The act of defending any of the cardinal virtues has today all
       the exhilaration of a vice."
                                     - G.K.Chesterton A Defense of =20
Humility

Hi,

Yes, choco has fine-grained events (instantiation, removal, bound 
modification,...).
For a small exemple on how you can use it, you can look at:  
http://choco-solver.net/index.php?title=DiffVec.java


Hope it helps.
Guillaume

Malcolm Ryan a écrit :
> Hi,
>
> I've been doing some constraint programming in ECLiPSe prolog, but  
> the language is beginning to really annoy me and I've been thinking  
> about migrating to a different platform. Choco looks like a  
> possibility, but I need to make sure it can do the things I need.  
> Eclipse has an event model whereby you can set an action to occur  
> when a particular event occurs on a variable. Defined events include  
> an event whenever the domain is constrained and an event when the  
> variable is instantiated. Is there an equivalent functionality in Choco?
>
> Malcolm
>
> --
> Many clever men like you have trusted to civilisation.
> Many clever Babylonians, many clever Egyptians,
> Many clever men at the end of Rome.
>                                - G.K.Chesterton, The Napoleon of  
> Notting Hill
>
>
>
>
> -------------------------------------------------------------------------
> This SF.net email is sponsored by DB2 Express
> Download DB2 Express C - the FREE version of DB2 express and take
> control of your XML. No limits. Just data. Click to get it now.
> http://sourceforge.net/powerbar/db2/
> _______________________________________________
> Choco-users mailing list
> Cho...@li...
> https://lists.sourceforge.net/lists/listinfo/choco-users
>
>   

Hi,

Well, this is not really an available feature right now. But you can
simulate it easily. For instance, you can do a fake constraint which
only watch events on all variables. For instance you can use the
following code.

Hope it helps,

Guillaume


===============

package mestests;

import choco.integer.IntDomainVar;
import choco.integer.constraints.AbstractLargeIntConstraint;
import choco.ContradictionException;
import choco.Problem;

/**
 * Created by IntelliJ IDEA.
 * User: grochart
 * Date: 5 juin 2007
 * Time: 09:58:16
 * To change this template use File | Settings | File Templates.
 */
public class TestVarListener {

  static class VarListener extends AbstractLargeIntConstraint {
    public VarListener(IntDomainVar[] vars) {
      super(vars);
    }


    public void propagate() throws ContradictionException {
      // Nothing is done !
    }

    public void awakeOnInf(int idx) throws ContradictionException {
      System.out.println("Lower bound of " + getIntVar(idx) + " was
increased !");
    }

    public void awakeOnSup(int idx) throws ContradictionException {
      System.out.println("Upper bound of " + getIntVar(idx) + " was
decreased !");
    }

    public void awakeOnInst(int idx) throws ContradictionException {
      System.out.println(getIntVar(idx) + " was instantiated !");
    }

    public void awakeOnRem(int idx, int x) throws ContradictionException {
      System.out.println("Value " + x + " of " + getIntVar(idx) + "
was removed !");
    }

    public boolean isSatisfied() {
      return true;
    }
  }

  public static final int NB_REINES = 8;


  public static void main(String[] args) {
    long time = System.currentTimeMillis();
    System.out.println("NReine model 2");

    // ******* 0. Problem creation **********
    Problem pb = new Problem();

    // ******* 1. Variables creations *********
    IntDomainVar[] vars =
        createVariables(pb);

    // ******* 2. Constraints posting *********
    postConstraints(pb, vars);

    // ******* 3. Heuristic *********
    setHeuristic(pb);

    // ******* 4. Solving *********
    pb.solve();

    // ******* 5. Displaying solution *********
    displayResult(pb, vars);

    System.out.println("Time ellapsed: " + (System.currentTimeMillis()
- time) + "ms.");
  }

  private static IntDomainVar[] createVariables(Problem pb) {
    IntDomainVar[] vars = new IntDomainVar[NB_REINES];
    for (int i = 0; i < NB_REINES; i++) {
      vars[i] = pb.makeEnumIntVar("x" + i, 0, NB_REINES - 1);
    }
    return vars;
  }

  private static void postConstraints(Problem pb, IntDomainVar[] vars) {
    postConstraints1(pb, vars);
    postConstraints2(pb, vars);
    pb.post(new VarListener(vars));
  }

  private static void postConstraints1(Problem pb, IntDomainVar[] vars) {
    for(int i = 0; i < NB_REINES; i++) {
      for(int j = i+1; j < NB_REINES; j++) {
        pb.post(pb.neq(vars[i], vars[j]));
      }
    }
  }

  private static void postConstraints2(Problem pb, IntDomainVar[] vars) {
    for (int i = 0; i < NB_REINES; i++) {
      for (int j = i + 1; j < NB_REINES; j++) {
        int k = j - i;
        pb.post(pb.neq(vars[i], pb.plus(vars[j], k)));
        pb.post(pb.neq(vars[i], pb.minus(vars[j], k)));
      }
    }
  }

  private static void setHeuristic(Problem pb) {
    //pb.getSolver().setValIterator(new DecreasingDomain());
  }

  private static void displayResult(Problem pb, IntDomainVar[] vars) {
    if (pb.getSolver().getNbSolutions() > 0) {
      System.out.println("Found solution : ");
      for (int i = 0; i < NB_REINES; i++) {
        int val = vars[i].getVal();
        for (int j = 0; j < NB_REINES; j++) {
          System.out.print(val == j ? "R " : ". ");
        }
        System.out.println("");
      }
    } else {
      System.out.println("No solution found !!");
    }
  }
}


===============




On 6/5/07, Malcolm Ryan <mal...@cs...> wrote:
> Hi,
>
> I've been doing some constraint programming in ECLiPSe prolog, but
> the language is beginning to really annoy me and I've been thinking
> about migrating to a different platform. Choco looks like a
> possibility, but I need to make sure it can do the things I need.
> Eclipse has an event model whereby you can set an action to occur
> when a particular event occurs on a variable. Defined events include
> an event whenever the domain is constrained and an event when the
> variable is instantiated. Is there an equivalent functionality in Choco?
>
> Malcolm
>
> --
> Many clever men like you have trusted to civilisation.
> Many clever Babylonians, many clever Egyptians,
> Many clever men at the end of Rome.
>                                - G.K.Chesterton, The Napoleon of
> Notting Hill
>
>
>
>
> -------------------------------------------------------------------------
> This SF.net email is sponsored by DB2 Express
> Download DB2 Express C - the FREE version of DB2 express and take
> control of your XML. No limits. Just data. Click to get it now.
> http://sourceforge.net/powerbar/db2/
> _______________________________________________
> Choco-users mailing list
> Cho...@li...
> https://lists.sourceforge.net/lists/listinfo/choco-users
>

Hi,

I've been doing some constraint programming in ECLiPSe prolog, but  
the language is beginning to really annoy me and I've been thinking  
about migrating to a different platform. Choco looks like a  
possibility, but I need to make sure it can do the things I need.  
Eclipse has an event model whereby you can set an action to occur  
when a particular event occurs on a variable. Defined events include  
an event whenever the domain is constrained and an event when the  
variable is instantiated. Is there an equivalent functionality in Choco?

Malcolm

--
Many clever men like you have trusted to civilisation.
Many clever Babylonians, many clever Egyptians,
Many clever men at the end of Rome.
                               - G.K.Chesterton, The Napoleon of  
Notting Hill