Nicolas BERGER wrote: > Hi everyone > > Is it possible to declare constants i.e. variable that are not reduced ? > For example, in the following problem, not reducing the domain of D but > only the domains of X and Y : > > [X,Y] $:: [-1.1..0.72], > D :: [1,4,7], > X + D #< 3, > Y + D #< 1. Hi Nicolas, What exactly do you mean with this? Maybe you mean that for each value in the domain of D, there exists a value in the domain of X such that the constraint X+D #< 3 is satisfied. If this is the case, you probably need a quantified CSP solver (QCSP). Cheers, Marco -- Marco Gavanelli, Ph.D. Computer Science Division Dipartimento di Ingegneria University of Ferrara Via Saragat 1 - 44100 Ferrara (Italy) Tel +39-0532-97-4833 Fax +39-0532-97-4870 http://www.ing.unife.it/docenti/MarcoGavanelli/Received on Fri Jun 15 2007 - 12:23:52 CEST
This archive was generated by hypermail 2.2.0 : Thu Feb 02 2012 - 02:31:58 CET