descriptionSimple SAT Solver in Haskell
ownerdion.blazakis@gmail.com
last changeFri, 10 Oct 2008 04:30:33 +0000 (10 00:30 -0400)
content tags
add:
readme
An implementation of the MiniSAT architecture in Haskell. It is based on the DPLL algorithm (conflict driven backtracking) with watched literals and, eventually, dynamic variable ordering.
shortlog
2008-10-10 Dion BlazakisClean up traces.master
2008-10-09 Dionysus BlazakisTracked down a bunch of horribly stupid bugs (I should...
2008-10-09 Dion BlazakisMore monad reorganization
2008-10-08 Dionysus BlazakisOn the way to monadizing the other piece to take advant...
2008-10-08 Dionysus BlazakisRemoved older version of some Monadic stuff.
2008-10-08 Dionysus BlazakisHuzzah, part of it converted to monadic style
2008-10-08 Dionysus BlazakisRename some of the variables to make it less ugly.
2008-10-08 Dion BlazakisLots of code re-organization
2008-10-07 Dionysus BlazakisUse a map for the variable bindings, cut down accesses.
2008-10-07 Dionysus BlazakisFixed the watchlist updating to update the clause for...
2008-10-07 Dionysus Blazakis- Add the (buggy) monadified version
2008-10-06 Dionysus BlazakisInitial commit
heads
15 years ago master