Simon Cruanes
|
431d8fe4ac
|
small style change
|
2019-02-09 16:17:15 -06:00 |
|
Simon Cruanes
|
a57fdcdeda
|
refactor: use msat 0.8
|
2019-02-01 20:57:44 -06:00 |
|
Simon Cruanes
|
27d1841f6b
|
wip: migrate to msat 0.8
|
2019-01-28 21:09:57 -06:00 |
|
Simon Cruanes
|
c2d79b2e6a
|
fix(main): properly handle option no-restarts
|
2018-08-18 18:05:22 -05:00 |
|
Simon Cruanes
|
9ac274fc09
|
refactor: simplify literals; remove useless casts in CC; bit for pending nodes
|
2018-06-22 19:38:04 -05:00 |
|
Simon Cruanes
|
c8ca60461a
|
fix: typo in Th_bool
|
2018-06-16 20:47:23 -05:00 |
|
Simon Cruanes
|
080cde778e
|
feat(model): proper model construction for CC + fun interpretation
|
2018-06-11 21:42:02 -05:00 |
|
Simon Cruanes
|
04f25779fa
|
refactor(term): much simpler term model, without builtins or typeclass
just use a few custom functions in `Cst.t`
|
2018-05-25 23:45:15 -05:00 |
|
Simon Cruanes
|
fade033458
|
refactor: get SAT properly again on some problems
|
2018-05-20 14:30:36 -05:00 |
|
Simon Cruanes
|
24bbe97ceb
|
rename to sidekick
|
2018-05-09 19:28:41 -05:00 |
|
Simon Cruanes
|
d19b798ee9
|
add ability to parse and process dimacs files
|
2018-04-11 19:57:51 -05:00 |
|
Simon Cruanes
|
d53bd8671a
|
lower overhead for adding clauses to the SAT solver
- directly build clauses from arrays
- use IArrays rather than lists, when possible
- pushing local/persistent clauses is now direct, no more queues
|
2018-02-19 19:47:03 -06:00 |
|
Simon Cruanes
|
2fcef323b3
|
move back process to dagon_smtlib
|
2018-02-11 10:47:47 -06:00 |
|