Guillaume Bury
|
1e2dc299ce
|
WIP: add dedukti output (not functional yet)
|
2016-05-20 17:03:22 +02:00 |
|
Guillaume Bury
|
ea518c6ab3
|
Update for compatibility with ocaml 4.00.1
|
2016-02-29 13:43:46 +01:00 |
|
Guillaume Bury
|
b6effe691c
|
Added dummy arguments to some functors
Some functors lacked a dummy argument, and thus
could introduce some problems if duplicated (because
they would share the same internal state).
|
2016-02-29 10:58:22 +01:00 |
|
Guillaume Bury
|
ce65f10f9c
|
Big cleanup of interfaces. Breaks retro-compat !
|
2016-01-31 02:09:16 +01:00 |
|
Guillaume Bury
|
ea1a360148
|
Merge branch 'master' of github.com:Gbury/mSAT
|
2016-01-21 03:52:53 +01:00 |
|
Guillaume Bury
|
9a481f6450
|
Better proofs
Proof graphs are now entirely stored in
the cpremise field of clauses
|
2016-01-21 03:34:18 +01:00 |
|
Simon Cruanes
|
756363ffd6
|
everwhere, use new Log interface and remove the functor on Log_intf
|
2016-01-20 21:05:22 +01:00 |
|
Simon Cruanes
|
15e5a4224d
|
ocp-indent all the files, for the greater good!
|
2015-11-25 10:04:01 +01:00 |
|
Guillaume Bury
|
aed3aeb17c
|
A bit of restructuring to have cleaner dependencies between fonctors
|
2015-07-21 19:20:40 +02:00 |
|
Guillaume Bury
|
9c1ca06aea
|
Dot output is now available through independent backend
|
2015-07-09 19:03:44 +02:00 |
|
Guillaume Bury
|
e7140d6897
|
Added some abstraction to allow for more direct types int the pure SAT
solver
|
2015-06-26 14:12:47 +02:00 |
|
Guillaume Bury
|
5047882fc7
|
Fix for dependencies during proof computing
|
2015-03-13 15:03:30 +01:00 |
|
Guillaume Bury
|
ee13eb366b
|
Fix for incomplete proofs due to hypothesis not proved
|
2015-03-13 14:48:20 +01:00 |
|
Guillaume Bury
|
3203dadb8d
|
Replaced clause number by tag in solver.assume
|
2015-02-06 15:46:56 +01:00 |
|
Guillaume Bury
|
d227d4c8b5
|
Solver modules are paramtrized by log module
|
2015-01-20 12:58:28 +01:00 |
|
Guillaume Bury
|
ca70f87973
|
Mcsat now works
|
2014-12-16 17:30:14 +01:00 |
|
Guillaume Bury
|
5752a9f139
|
Changed theory interface to allow pushing of clauses
|
2014-11-19 21:56:24 +01:00 |
|
Guillaume Bury
|
8e0dfc539c
|
Check now also whecks model if sat.
Time/Memory limits now only applies to proof search (and not to model checking of proof building anymore).
|
2014-11-18 16:16:02 +01:00 |
|
Guillaume Bury
|
c6dd201014
|
Fixed bug in smtlib translation
|
2014-11-15 19:42:09 +01:00 |
|
Guillaume Bury
|
384bcb7270
|
Better explanations in equivalence closure
|
2014-11-15 18:39:19 +01:00 |
|
Guillaume Bury
|
6801acdafd
|
Normalisation is now done in constructors for smt
|
2014-11-15 12:20:34 +01:00 |
|
Guillaume Bury
|
e92740e75e
|
Better integration of smt into sat-solve (sic)
|
2014-11-15 00:59:09 +01:00 |
|
Guillaume Bury
|
fcbcf5a9d4
|
Small fix for tautologies in cc for smt
|
2014-11-14 17:53:16 +01:00 |
|
Guillaume Bury
|
566c30bdcc
|
Added Smt module
|
2014-11-14 17:40:29 +01:00 |
|
Guillaume Bury
|
b7c5b39e02
|
moved smt folder to old
|
2014-11-14 11:58:43 +01:00 |
|
Guillaume Bury
|
dc43c28a02
|
Everything has now been properly indented with ocp-indent.
|
2014-10-31 16:40:59 +01:00 |
|
Guillaume Bury
|
a00506b95f
|
Solver module is now functorised. 'make' now compiles.
|
2014-10-31 16:21:11 +01:00 |
|
Guillaume Bury
|
13060e348d
|
Removed trailing whitespaces
|
2014-10-29 14:55:23 +01:00 |
|
Simon Cruanes
|
05f8d0d873
|
allow to build Or[], returning false
|
2014-03-06 17:35:24 +01:00 |
|
Simon Cruanes
|
c2d379de10
|
fix Tseitin CNF conversion;
more combinators to build formulas;
Smt.eval function to extract the propositional model
|
2014-03-06 10:53:56 +01:00 |
|
Simon Cruanes
|
d7f09c9791
|
initial commit
|
2014-03-06 10:45:04 +01:00 |
|