Hi,
On 05/18/2014 06:38 PM, Philipp Keck wrote:
> Hi,
>
> I am new to Gecode and also to Constraint Programming. While my first
> problem may be a general CP question (so off-topic here? In that case
> ignore it please.), my second problem is Gecode-specific.
>
> My first problem is that Gecode
Hi everybody,
i actually did something similar using Gecode,
using it as a theory solver for an SMT system.
The approach is the same as from Mauricio,
except that my ask method is allowed to return Maybe, and postpone the
request. (if propagation is strong enough to tell me if the constraint
is en
Let me also thank for this,
this makes Gecode even more usable as a library in a project where you
do not use the thread support of gecode
(always problems with linking to pthread)
Best,
Max
On 10/15/2013 12:47 AM, Guido Tack wrote:
> Great, thanks for the patch! I added it to the svn trunk and
Like for NP problems this depends on the problem itself.
But given you have so many variables and call them "decision variables"
i would guess that most of them are boolean?
If this is the case you could try an encoding in SAT or ASP (Answer Set
Programming) where solvers are capable of handling su
I recognized that the div constraint for integers removes the zero from
the domain of the second argument (to avoid division by zero).
This seems to be a problem as i want to express the following:
x/y+c > 7 reified b
So, if b1 is true, y should not be zero or otherwise some undefined
behaviour
Christian
--
Christian Schulte, www.ict.kth.se/~cschulte/
-Original Message-
From: users-boun...@gecode.org [mailto:users-boun...@gecode.org] On Behalf
Of Max Ostrowski
Sent: Tuesday, October 23, 2012 1:31 PM
To: users@gecode.org
Subject: [gecode-users] Number of branches/choices
Hi,
i
Hi,
i want to compare some statistics,
and want to find out how many choices (non-deterministic decisions)
gecode has made during branching.
(So, not talking about non-deterministic propagation, just simple
select/propagate).
The statistic object
dfsSearchEngine_->statistics().node
tells me s
Hi everybody,
in case of the modification event Gecode::Int::ME_INT_VAL
i want to know what is the meaning of the IntView::min(d) and max(d)
methods (d==delta)
In the case of ME_INT_BND,
min(d)..max(d) is the range that was removed from the domain.
In the case of ME_INT_VAL
i sometimes have it b
>
> Christian
>
>
>
> --
>
> Christian Schulte, www.ict.kth.se/~cschulte/
>
>
>
> *From:* users-boun...@gecode.org [mailto:users-boun...@gecode.org] *On
> Behalf Of *Max Ostrowski
> *Sent:* Thursday, August 23, 2012 2:05 PM
> *To:* Guido Tack
> *Cc:* users@gec
t/
> <http://www.csse.monash.edu/%7Eguidot/>
>
>
>
> On 23/08/2012, at 2:04 PM, Max Ostrowski <mailto:ostro...@cs.uni-potsdam.de>> wrote:
>
>> Great, this really solves the problem.
>> Have not thought of this.
>> Thank you very very much.
&
e view functions are not meant to be used in models.
> If lq returns failure, you have to check that yourself, or the space
> won't be failed.
>
> Cheers,
> Guido
>
> --
> Guido Tack
>
>
> On 23/08/2012, at 13:20, Max Ostrowski <mailto:ostro...@cs.uni-potsdam.
Actually its quite complicated.
I'm currently debugging and have 60 constraints written on paper that
have this effect.
Two of them are actually not reified constraints but directly using
IntView::lq(constant)
I can give you a description where it happens in my system, but it will
be a mess for yo
Can the order of propagation influence the final result?
Given a list of reified constraints L posted with ICL_DEF
for (i in L)
{
i == true;
status();
}
// the space is failed
Now the same thing with the list sorted by some order
randomize_order(L)
for (i in L)
{
i == true;
status();
}
// th
gt;
> --
>
> Christian Schulte, KTH, web.it.kth.se/~cschulte/
>
>
>
> *From:* users-boun...@gecode.org [mailto:users-boun...@gecode.org] *On
> Behalf Of *Max Ostrowski
> *Sent:* Tuesday, August 21, 2012 10:12 AM
> *To:* users@gecode.org
> *Subject:* [gecode-users] Wr
Hi, i want to write an advisor for my propagator that gets notified when the
watched variable changes it bounds.
In the attached code, the advise method now prints the view min and max.
According to the Gecode Documentation min(d)/max(d) return the old value
of the variable,
while min()/max() retur
stian Schulte, www.ict.kth.se/~cschulte/
>
>
>
> *From:* users-boun...@gecode.org [mailto:users-boun...@gecode.org] *On
> Behalf Of *Guido Tack
> *Sent:* Friday, August 17, 2012 9:06 PM
> *To:* Max Ostrowski
> *Cc:* users@gecode.org
> *Subject:* Re: [gecode-users] Removing pro
Is there a way to remove all propagators from a space "a".
In this way the space contains only the restricted variables so far but
no constraints on them.
I need such a space and i want to avoid creating an empty space "b" and
adding all variables and constraining them to the values they had in "a"
> some easy to compute upper and lower bounds). But you don't have to do
> the propagators' job.
>
> Cheers,
> Guido
>
> On 13/08/2012, at 8:57 PM, Max Ostrowski <mailto:ostro...@cs.uni-potsdam.de>> wrote:
>
>> Thank you very much for the fast answer.
t;
> Iter::Ranges::Inter >
> u(inter0,inter1);
>
> IntVar a(*this,IntSet(u));
>
> You can also use the n-ary variants of the iterators if you need to
> compute a union or intersection of more than two sets.
>
> Cheers,
> Guido
>
> On 08/08/
that take arrays as input, they
will do what
you want.
Best
Christian
--
Christian Schulte, KTH, web.it.kth.se/~cschulte/
-Original Message-
From: users-boun...@gecode.org [mailto:users-boun...@gecode.org] On
Behalf Of
Max Ostrowski
Sent: Thursd
ies, as long as you don't
> change the random seed).
>
> Cheers,
> Guido
>
> --
> Guido Tack
> http://www.csse.monash.edu/~guidot/
> <http://www.csse.monash.edu/%7Eguidot/>
>
>
>
> On 29/06/2012, at 8:10 PM, Max Ostrowski wrote:
>
>> I h
I have a problem with my software clingcon, that uses gecode.
This piece of software is an SMT solver, that uses gecode as a theory
solver.
But i can also use it as a solver for arithmetic, without any SAT component.
Now my question: Is the behavior of Gecode reproducible.
Whenever i start my pro
will change reification for the next
>>> major release and might at that time also think how to fix passing
>>> the consistency level.
>>>
>>>
>>>
>>> For the time being you should stick to what Guido has suggested.
>>>
>>>
>>>
>&
www.ict.kth.se/~cschulte/
>
>
>
> *From:* users-boun...@gecode.org [mailto:users-boun...@gecode.org] *On
> Behalf Of *Max Ostrowski
> *Sent:* Tuesday, April 10, 2012 12:42 PM
> *To:* Guido Tack
> *Cc:* users@gecode.org
> *Subject:* Re: [gecode-users] Reified Constraints do not
raints (such as x==5 in this case) the IntConLevel is
> ignored. To get the full propagation, you have to post the constraint
> directly, like this:
>
> Gecode::rel(*test, test->x_[1], IRT_EQ, 5, test->b_[1], ICL_DOM);
>
> Cheers,
> Guido
>
> On 10 Apr 2012, at 19
I have a small example where i do not understand why no propagation
takes place.
test is a pointer to the space instance
x_ is an array of 10 IntVars(0,10)
b_ is an array of 2 BoolVars(0,1)
LinRel rel1(test->x_[0],IRT_EQ,5);
rel1.post(*test,true,ICL_DEF);
Gecode::distinct(*test,test
Hi everybody,
i have to step into this discussion as i have similar demands ;)
I want to be notified whenever a boolean variable is assigned.
Currently i do this with a modified version of "wait". So i'm using a
propagator
that watches the boolean variable. It furthermore has a 4byte member
variab
on?
Does it just restore the effects of the propagation?
Does it just repost the decision (as i could do by hand saying post(x==1) )?
Best,
Max Ostrowski
___
Gecode users mailing list
users@gecode.org
https://www.gecode.org/mailman/listinfo/gecode-users
Hi, i want to use the wait function to get notified what a certain variable has
been assigned.
And i want to do this for some variables, to finally to something with them.
so i want to have
wait(*this,a,&foo);
wait(*this,b,&foo);
And in my function foo i want to add the variables into a list or
Hello everybody,
as variables in gecode need to have a domain, i want to compute the domain of
the variables automatically, given the constraints.
I could also let the constraints restrict the domains of my variables, but as i
understood, this is similar to propagation and could take some time.
=15, a lot of the propagation could be reused if it does not
affect the constraint b_n-2.
So is there a possibility in Gecode that does (similar) things?
Best,
Max
Original-Nachricht
> Datum: Mon, 18 Jul 2011 12:54:24 +0200
> Von: Guido Tack
> An: Max Ostrowski
&g
> Betreff: Re: [gecode-users] IIS using undoing
>
> Thanks for the information.
> Do you think that recomputation in this case could pay off?
> Furthmore, to turn it into a constraint problem, how could i configure my
> search in a way that the reified constraint xb==x becomes true/false, withou
,
Max
Original-Nachricht
> Datum: Mon, 18 Jul 2011 10:30:35 +0200
> Von: Guido Tack
> An: Max Ostrowski
> CC: users@gecode.org
> Betreff: Re: [gecode-users] IIS using undoing
> Hello Max,
>
> you may be able to turn this into a constraint problem t
Original-Nachricht
> Datum: Mon, 18 Jul 2011 10:37:32 +0200
> Von: Guido Tack
> An: Max Ostrowski
> CC: users@gecode.org
> Betreff: Re: [gecode-users] Initializing domain of IntegerVars
> On 18 Jul 2011, at 10:21, Max Ostrowski wrote:
>
> > Hello
Hello,
currently i have to create some IntegerVariables and some constraints, and i'm
doing this using the IntVar/2 constructor, restricting the variables domain.
Due to some design decisions it could be necessary to change this to something
like:
IntVar x(*this, MIN_INT,MAX_INT);
dom(*this, x
Hello,
i want to compute an "Irreducible Infeasible Set" (IIS) and some derivatives.
This means, given a set of contraints C that are infeasible i want to find the
source of infeasibility.
I'm satisfied with a rather small (but not necessarily optimal) and fast
approach.
A simple way of doing th
i only start to search
after i have a full propositional assignment.
Thanks a lot,
Max Ostrowski
Original-Nachricht
> Datum: Mon, 20 Jun 2011 13:31:53 +0200
> Von: Guido Tack
> An: Max Ostrowski
> CC: Mikael Zayenz Lagerkvist , users@gecode.org
> Betreff: Re: [geco
ng learning in Gecode, i will contact
the author to find out what he did. (But i suppose that he extended Gecode or
did wrote own propagators, which i want to avoid).
Best,
Max
>
> Cheers,
> Mikael
>
> On Mon, Jun 20, 2011 at 10:05 AM, Max Ostrowski wrote:
>
> > Sorry
Sorry for reposting, i already asked this question 2 years ago, but now i
managed to read more of the manual and my questions will be more refined.
For each constraint that i post, i want to find out which variables are
propagated by the corresponding propagator.
Also the ordering would be inter
Best,
Max
Original-Nachricht
> Datum: Tue, 14 Jun 2011 15:12:48 +0200
> Von: "Christian Schulte"
> An: "\'Max Ostrowski\'" , users@gecode.org
> Betreff: RE: [gecode-users] Branching on temporary variables
> Hi,
>
> 1) Not quite. In
Hello everybody,
i have some expressions (linear and non-linear) stored in a "Gecode::LinExpr"
object.
Know i want to post a global constraint on them.
So, expressions for example:
//pseudocode
LinExpr var1 = a+b*c;
LinExpr var2 = 4-7
and i want the results of them to be allDifferent (distinct
ditional layer
> of
> abstraction (minimodel) to deal with expressions.
>
> Christian
>
> --
> Christian Schulte, KTH, web.it.kth.se/~cschulte/
>
>
> -Original Message-
> From: users-boun...@gecode.org [mailto:users-boun...@gecode.org] On Behalf
> Of M
Hello everybody,
as i'm developing an SMT-like solver, i have a special syntax for the
constraints of Gecode and i also have to handle things.
b(1..3).
$count[a(X) $== c+5*7-b : b(X)] $> 0.
This shall represent an count constraint constraint.
count(x,y,>,0) where x is a set of variables (a(1),
Hello everybody,
i want to set the domain of an uninitialized IntVar to,
for example [1-7, 5-14, 23-42].
I found in the documentation that i can use a set to initialize the domain of
the variable, but i do not want to explicitly enumerate the set.
(the ranges could be large).
So is there a possi
44 matches
Mail list logo
