----- On 1 Jun, 2015, at 14:35, René J.V. Bertin [email protected] wrote:
> On Monday June 01 2015 13:07:45 Clemens Lang wrote: >> In the long term, this may become easier when (and if) we finish the >> SAT-solving > ^^^ > Translation? http://en.wikipedia.org/wiki/Boolean_satisfiability_problem http://www.mancoosi.org/papers/leberre-sat-beyond.pdf Basically, the problem of resolving dependencies can be mapped to a SAT problem, which can be solved and optimized using a standard SAT solver. -- Clemens Lang _______________________________________________ macports-dev mailing list [email protected] https://lists.macosforge.org/mailman/listinfo/macports-dev
