Hi,
On second thought you may want to reduce the number of propagators:
instead of C1 OR (C1 AND C2) OR (C1 AND C2 AND C3) you may do (by using
FD.conj):
C3 -> (C2 -> C1)
However, this is just an idea. I did not test this model ;-)
Best,
Torsten
On Wed, 2003-11-26 at 14:30, Tilo Behrmann wrote:
> Thanks Torsten
> i think thats a god Idear.
> I'm not shur that i can model this so.
>
> "Torsten Anders" <t.anders@qub.ac.uk> schrieb im Newsbeitrag
> news:1069845525.1238.17.camel@chewa...
> >
> > Dear Tilo,
> >
> > Just a quick idea to express your problem. Say you have three
> > constraints: C1, C2, C3. These constraints have different importance:
> > C1_importance > C2_importance > C3_importance.
> >
> > Let these constraints be reified constraints (i.e. their truth value is
> > constrainable), then you may formulate a constraint statement with
> > logical connectives (using FD.conj and friends):
> >
> > C1 OR (C1 AND C2) OR (C1 AND C2 AND C3)
> >
> > Using best solution search you may search for a solution which fulfils
> > most constraints (by adding all truth values).
> >
> > Best,
> > Torsten
> >
> >
> > On Wed, 2003-11-26 at 08:46, Tilo Behrmann wrote:
> > > Thanks for answering my Question Christian.
> > >
> > > To your question i think there on a HCSP (Hiearichal Constraint
> Satisfaction
> > > Problem) that on defined by Wilson&Boringr(1989).
> > > That means you have Constraints with more different strengthens. Ergo
> must
> > > the strongest Constraint to be fulfilled the weakest Constraint not
> > > necessarily fulfilled.
> > > I have thougt in Oz is implement a procedure to handle the wieghting of
> the
> > > Contraint automatically and the consideration in the result.
> > > I hope this accuratly described the meaning of your question.
> > >
> > > "Christian Schulte" <schulte@imit.kth.se> schrieb im Newsbeitrag
> > > news:bpip3j$eho$1@grizzly.ps.uni-sb.de...
> > > > You have to do it yourself. What do you have exactly in mind? There is
> a
> > > > great deal of different work which is characterized by these two
> terms.
> > > >
> > > > Christian
> > > >
> > > > "Tilo Behrmann" <t.behrmann@gmx.net> wrote in message
> > > > news:bpcl7d$5rf$1@grizzly.ps.uni-sb.de...
> > > > > Dear list,
> > > > >
> > > > > one short question have OZ a procedure to handle Hierarchical
> > > Constraints
> > > > > (soft and hard Constraints) or must I implement this by myself.
> > > > >
> > > > > Thanks
> > > > >
> > > > > -
> > > > > Please send submissions to users@mozart-oz.org
> > > > > and administriva mail to users-request@mozart-oz.org.
> > > > > The Mozart Oz web site is at http://www.mozart-oz.org/.
> > > > > Please send bug reports to bugs@mozart-oz.org.
> > > >
> > > >
> > > > -
> > > > Please send submissions to users@mozart-oz.org
> > > > and administriva mail to users-request@mozart-oz.org.
> > > > The Mozart Oz web site is at http://www.mozart-oz.org/.
> > > > Please send bug reports to bugs@mozart-oz.org.
> > >
> > > -
> > > Please send submissions to users@mozart-oz.org
> > > and administriva mail to users-request@mozart-oz.org.
> > > The Mozart Oz web site is at http://www.mozart-oz.org/.
> > > Please send bug reports to bugs@mozart-oz.org.
> > --
> > Torsten Anders <t.anders@qub.ac.uk>
> >
> > -
> > Please send submissions to users@mozart-oz.org
> > and administriva mail to users-request@mozart-oz.org.
> > The Mozart Oz web site is at http://www.mozart-oz.org/.
> > Please send bug reports to bugs@mozart-oz.org.
>
> -
> Please send submissions to users@mozart-oz.org
> and administriva mail to users-request@mozart-oz.org.
> The Mozart Oz web site is at http://www.mozart-oz.org/.
> Please send bug reports to bugs@mozart-oz.org.
-- Torsten Anders <t.anders@qub.ac.uk>- Please send submissions to users@mozart-oz.org and administriva mail to users-request@mozart-oz.org. The Mozart Oz web site is at http://www.mozart-oz.org/. Please send bug reports to bugs@mozart-oz.org.