A little more detail you can find in
http://web.it.kth.se/~cschulte/paper.html?id=SchulteStuckey:TOPLAS:2009
Apart from that, there is a journal paper in the making that will describe
many decisions and techniques inside the Gecode kernel. It is not
unrealistic that the paper will be available early next year as pre-print.
Christian
-----Original Message-----
From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED] On Behalf
Of Pedro Salgueiro
Sent: Monday, November 24, 2008 5:53 PM
To: gecode list
Subject: Re: [gecode-users] How does Gecode works ?
Hi!
I just found this old post:
http://www.ps.uni-sb.de/pipermail/gecode-users/2008-April/002142.html
Debdeep Banerjee wrote:
> Hi,
> I am just wondering how gecode works. What I think is
the following
>
> 1. We create the variables and domains
> 2. Then we post constraints
> 3. Then we define the branching
> 4. We start searching. ( I am here referring to the
DFS search)
> 1. the search will do the propagation, if any
inconsistency
> found
> then fail immediately
> 2. then branching will produce a variable-value
pair through the
> description() method
> 3. then commit() will produce a binary branching
> a. variable = value , left
> b. variable != value. right
> 4. the search will continue picking up the left
branch and call
> the propagation method, if failed, it will try the
right branch.
>
> Is this correct ?
Yes, that's the overall picture.
Is there any paper/publication that dsecribes more in depth how gecode
works?
Kind regards,
Pedro Salgueiro
_______________________________________________
Gecode users mailing list
[EMAIL PROTECTED]
https://www.gecode.org/mailman/listinfo/gecode-users
_______________________________________________
Gecode users mailing list
[EMAIL PROTECTED]
https://www.gecode.org/mailman/listinfo/gecode-users
