] On Behalf
Of Amina Kemmar
Sent: Monday, June 23, 2014 10:34 AM
To: users@gecode.org
Subject: [gecode-users] Reification of the extensional constraint
Hi all,
I want to implement a half reification for the constraint Extensional, so to
propagate the constraint when b=1, I must call the method
Hi all,
I want to implement a half reification for the constraint /Extensional/,
so to propagate the constraint when b=1, I must call the method
*Gecode::Int::Extensional::post_lgp(home,x,dfa)*, such that *x* is of
type *VarArgArray*, the propagate function handles on views
(ViewArray), how c
Hi everybody,
Thanks for the explanation. I need just a half reification of the
extensional constraint. For that, i implement a class named "reg"
allowing to specify a control variable "b" as follow:
template
class reg : public Propagator{
protected:
ViewArray x;
DFA dfa;
Hi,
you're right that you'd have to implement your own propagator for that. Before
you do that you should check if you actually need full reification (i.e. b <->
c) or if an implication would be enough (b -> c). In the latter case, you
don't need to implement the negation of c (where c is you
Hi all,
I want to use a reification version of the extensional constraint, but I
think that it is not implemented in Gecode.
The chapter 24 explains how to implement a reification version of a
constraint, I understand that we need the negation of the automata DFA.
So, I want to know if there i
