Hi, [...] > This dependency solver code in this package is based on two major, but > independent, blocks: > . > 1. Using a dictionary approach to store and retrieve package > and dependency information. > 2. Using satisfiability, a well known and researched topic, for > resolving package dependencies. > . > Search the internet for 'sat solver' to get links to the theory behind it. > . [...]
Is there any chance the package could be refactored such as not to exclusively rely on the built-in SAT solver? Debian presently ships (at least) sat4j, Minisat and PicoSAT as competitive (i.e., participating in the SAT competition) solvers. As this is C source, linking against PicoSAT would likely be the easiest of those. Best, Michael
pgpomAvCMYPla.pgp
Description: PGP signature
