- Mail actions: [ respond to this message ] [ mail a new topic ]
- Contemporary messages sorted: [ by date ] [ by thread ] [ by subject ] [ by author ] [ by messages with attachments ]

From: Joachim Schimpf <joachim.schimpf_at_...269...>

Date: Thu, 12 May 2011 12:38:28 +1000

Date: Thu, 12 May 2011 12:38:28 +1000

Bogdan Tanasa wrote: > Hi, > > > > I have an array of Boolean variables x_1, x_2, …, x_n and the following > relation: > > > > x_i = y(x_1, …, x_i-1) * z + (1 – y) * x_i. > > I my code I am invoking search / 6 on the x variables but I get a wrong > behavior. > > > > y is a Boolean function of the previous i – 1 variables while z is an > Boolean function which depends on completely other variables then x. > > > > The recursive relation should work like this: > > If y is 1 then x_i have to take the value of z and if y is 0 then x_i > should be instantiated by a search predicate. > > In other words if y is 1 the search procedure does not have to change > the value of x_i. > > > > I was expecting that x_i #= y(x_1, …, x_i-1) * z + (1 – y) * x_i will do > trick but it doesn’t. > > > > Can you please help with some ideas ? Hi Bogdan, If I understand your notation correctly, what you want (in ECLiPSe lib(ic) syntax) is, for all I: ( ...some expression involving X[1] to X[I-1]... ) => (X[I] #= Z) -- JoachimReceived on Thu May 12 2011 - 02:38:40 CEST

*
This archive was generated by hypermail 2.3.0
: Wed Sep 25 2024 - 15:13:20 CEST
*