1 |
-----BEGIN PGP SIGNED MESSAGE----- |
2 |
Hash: SHA256 |
3 |
|
4 |
On 06/11/14 08:43 AM, Ciaran McCreesh wrote: |
5 |
> On Thu, 06 Nov 2014 14:25:46 +0100 Jauhien Piatlicki |
6 |
> <jauhien@g.o> wrote: |
7 |
>> Mathematics you said? That's nice. You can, for example, redesign |
8 |
>> our portage's dependency solving algorithm, as it is quite slow |
9 |
>> at the moment. ) I do not know what it does have inside right |
10 |
>> now, but using SAT solver can be a good idea (there is a |
11 |
>> successful example already: |
12 |
>> https://en.opensuse.org/openSUSE:Libzypp_satsolver) |
13 |
> |
14 |
> A SAT encoding for dependency resolution is a *terrible* idea, for |
15 |
> all kinds of reasons (some of which are Gentoo-specific, and some |
16 |
> of which are not). |
17 |
> |
18 |
> [ Snip! ] |
19 |
> |
20 |
> What you need is for someone who understands CP and SAT to write a |
21 |
> resolver using algorithms inspired by how CP and SAT solvers work, |
22 |
> but not just blindly copying them. Doing this well is at least a |
23 |
> full year Masters level project... |
24 |
> |
25 |
|
26 |
|
27 |
...well, if this is an undergrad project, he could start with the SAT |
28 |
solver and then do what you recommend for his Masters' .. :) |
29 |
|
30 |
|
31 |
-----BEGIN PGP SIGNATURE----- |
32 |
Version: GnuPG v2 |
33 |
|
34 |
iF4EAREIAAYFAlRbkToACgkQ2ugaI38ACPBwYwEAtrXJFaVlf4WSv7eV8N+vX6T9 |
35 |
VFq56sh59LmeJ6+UMJcA/33trhsYdNAoRe6i/RWIIRQw8zyS37lIo6I9bLA7TEPg |
36 |
=7kZS |
37 |
-----END PGP SIGNATURE----- |