[Index] [Quick Jump] Package maintainers For package maintainers and hackage trustees Candidates This is a Haskell library for constraint programming using a SAT-solver, in particular MiniSAT. The names and types of these functions may change at any moment! The basic MiniSAT functions are: This library also supports boolean operators: And binary operators: We also have implemented a convenient type that links Haskell values with the SAT-solver: We also provide: We often want to add constraints that say that two things are equal, or not equal, to each other. Instances of this class are: We often want to add constraints that say that one thing is smaller than another. Instances of this class are: We have support for unary numbers (represented as sorted lists of Lits). These are handy when you want to count number of literals in a set being true, for example. We also provide: We have support for binary numbers (represented as lists of Lits). These are handy when you want to represent numbers that are large. We also provide: We also support linear arithmetic terms over a base type of variables (for example Lit, Unary, or Binary). (not done yet) We also support finding solutions that are minimized or maximized w.r.t. a particular argument. TODO: add optimization over binary numbers.