Yes, of course it is known to be a common concept. Another often used name
is "metaconstraint".
Christian
"Torsten Anders" <t.anders@qub.ac.uk> wrote in message
news:1064929484.1281.83.camel@chewa...
> Dear list,
>
> In Oz, reified constraints allow to constrain the truth value of
> constraints. For constraint programming I am mainly an Oz user. However,
> I found out that other constraint systems support similar concepts.
>
> For instance, I found reified constraints are supported in SICStus
> Prolog, ECLiPSe, and GNU PROLOG.
>
>
>
http://www.sics.se/sicstus/docs/latest/html/sicstus/Reified-Constraints.html
>
http://www.comp.nus.edu.sg/~cs5216/eclipse/doc/libman/node40.html#SECTION00523000000000000000
> http://pauillac.inria.fr/~diaz/gnu-prolog/manual/manual061.html
>
>
> Now, my question is: does somebody know whether the concept of
> constraining the truth values of constraints is perhaps called
> differently in other constraint logic programming
> languages/environments?
>
> (I am using reified constraints, e.g., to implement compositional rules
> which dependent on the context in the score or on other rules and I want
> to find out if somebody else did something similar already)
>
> Thank you!
>
> Best regards,
> Torsten Anders
>
> --
> Torsten Anders
> Sonic Arts Research Centre
> Queens University Belfast
> Tel: +44 28 9027 4831 (office)
> +44 28 9066 7439 (private)
>
>
> -
> 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.