At least for the dependency solving part, a generic exchange format has emerged: CUDF (http://www.mancoosi.org/cudf/ http://www.mancoosi.org/cudf/). Several ef

At least for the dependency solving part, a generic exchange format has emerged: CUDF (http://www.mancoosi.org/cudf/ http://www.mancoosi.org/cudf/). Several efficient solvers have been implemented that supports this input format. You can read about it more in http://opam.ocaml.org/doc/Specifying_Solver_Preferences.html#Yestherearedifferentversionsoftheuserpreferencelanguage http://opam.ocaml.org/doc/Specifying_Solver_Preferences.html... [1]: https://www.youtube.com/watch?v=E-gtFnbHcv0&list=UUP9g4dLR7xt6KzCYntNqYcw https://www.youtube.com/watch?v=E-gtFnbHcv0&list=UUP9g4dLR7x... [2]: http://ocaml.org/meetings/ocaml/2014/ocaml2014_17.pdf http://ocaml.org/meetings/ocaml/2014/ocaml2014_17.pdf This is at least used in OPAM (the OCaml package manager) and is also available for apt. If you are implementing a SAT solver for your package manager nowadays, you are doing it wrong. :)