Hello *, what do $subject and Sudoku problems share in common? SAT! http://en.wikipedia.org/wiki/Boolean_satisfiability_problem
Last week's hackathon triggered me to pay closer attention to what others are doing to treat the matter. I have found particularly interesting the work that has been applied as regards the topic, inside OCAML's OPAM: http://opam.ocamlpro.com/ So, this topic may have affinity with the discussed easyconfig v2.0 format. Granted, if there is a solution that works today, let's keep it! Yet, if someone would like to sniff the state-of-the-art in this domain, check: http://upsilon.cc/~zack/talks/2010/201008-debconf10-deps.pdf http://www.mancoosi.org/cudf/primer/ Real application of this is a bit more complicated, since proposed SAT solvers behave in a discrete N+ space, which implies versions should rather be like: "20131224", "20131225", "20131226". This in turn implies other side-effects, which I won't touch here since that would *really* be off-topic. Anyway, thought some of you might be interesting to glimpse this... enjoy, Fotis -- echo "sysadmin know better bash than english" | sed s/min/mins/ \ | sed 's/better bash/bash better/' # Yelling in a CERN forum
