[gecode-users] probabilistic choice process

[Christian Schulte]

Hi,

 

I actually do not understand your question nor its context. This user group
is dedicated to how to _use_ Gecode, a system designed for solving
combinatorial constraint problems.

 

Your questions go more into the direction of how to _abuse_ Gecode. The use
of constraints in CCP and its variants is completely different than the use
of constraints for  solving combinatorial problems. Constraints for CCP have
the following essential features:

 - to communicate you have to have basic constraints with which you can
build data structures. That's not available here.

 - for CCP you are interested in synchronization through entailment over
data structures. That's not available here.

 

So why bother with Gecode? It does not strike me as meaningful.

 

Sorry for being so frank

Christian

 

--

Christian Schulte, www.ict.kth.se/~cschulte/

 

From: users-bounces at gecode.org [mailto:users-bounces at gecode.org] On Behalf
Of Mauricio Toro
Sent: Monday, June 09, 2008 11:45 PM
To: users at gecode.org
Subject: [gecode-users] probabilistic choice process

 

Hello all,

 

I am trying to write something in Gecode, which could

be a propagator, with this semantic:

 

when <boolean_var1, boolean_var2, ... boolean_varn> do <something with those
who are assigned to true>

 

I know, it seems difficult. But, any ideas are welcome.

It will be used to implement an interpreter for a probabilistic CCP
calculus.

 

Thanks !

 

Mauricio

-- 
Mauricio Toro Bermudez
Estudiante de Ingeniería de Sistemas
Pontificia Universidad Javeriana, Colombia

Stagiare à l'Ircam
1, place Igor-Stravinsky 75004 Paris, 
France de 2008 à 2009 

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.ps.uni-sb.de/pipermail/users/attachments/20080610/ed5128f9/attachment.htm>