[Hackage] #500: develop a tool to find the maximal consistent set of hackage packages

[Hackage]

#500: develop a tool to find the maximal consistent set of hackage packages
----------------------------+-----------------------------------------------
  Reporter:  duncan         |        Owner:                 
      Type:  enhancement    |       Status:  new            
  Priority:  normal         |    Milestone:                 
 Component:  miscellaneous  |      Version:                 
  Severity:  normal         |   Resolution:                 
  Keywords:                 |   Difficulty:  project(> week)
Ghcversion:                 |     Platform:                 
----------------------------+-----------------------------------------------
Comment (by dbueno):

 This would fit in as a standard query if one had a pseudo-boolean based
 package dependency framework, like what I began to develop on my own
 branch of cabal-install.  The idea is to really use a SAT solver (or
 pseudo-boolean solver if you want to solve optimisation problems like this
 one).  I have that branch on my local machine; there are still some bugs
 and only SAT support -- but I would like to continue development.  If
 anyone would like to help, even just to discuss how to encode the package
 constraints as a SAT problem, please mail me.  My email is my trac
 username at gmail.com.

-- 
Ticket URL: <http://hackage.haskell.org/trac/hackage/ticket/500#comment:2>
Hackage <http://haskell.org/cabal/>
Hackage: Cabal and related projects