How does ECLiPSe solve reified constraints?
- From: "Linda" <xiaohui.ji@xxxxxxxxx>
- Date: 23 Aug 2005 02:30:18 -0700
I know that ECLiPSe was implemented in Prolog and which and many other
constraint solvers can solve reified constraints.
In my mind, reified constraints are made up of both boolean and
numerical variables, then how to solve the constraints that mix them
together, namely how reified constraints are solved?
I will be very thankful if someone can give me some points.
Best regards!
Linda
.
- Follow-Ups:
- Re: How does ECLiPSe solve reified constraints?
- From: Bart Demoen
- Re: How does ECLiPSe solve reified constraints?
- Prev by Date: Re: Help with lists.
- Next by Date: ISO Prolog Document
- Previous by thread: I now realize WHY my 'consistency check' was pointless: CLP.
- Next by thread: Re: How does ECLiPSe solve reified constraints?
- Index(es):
Relevant Pages
|
