Commit graph

27 commits

Author SHA1 Message Date
Guillaume Bury
510a8aaa34 [bugfix] Clause level now computed at creation
Apart from new assumptions, clause level can always
be computed from the histoy of the clause, so it is
better to do it in Solver_types when creating clauses.
Aditionally, it seems there was an error in the manual
computing of clause level somewhere, this fixes the bug.
2016-07-09 03:06:21 +02:00
Guillaume Bury
815098dde4 Propagation reasons are now far more explicit 2016-04-15 12:09:23 +02:00
Guillaume Bury
0186edbf34 [feature] Adds proofs for atoms true at level 0 2016-04-06 15:32:12 +02:00
Guillaume Bury
ddbedc6606 Better unsat_core 2016-01-21 16:39:35 +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
Guillaume Bury
2613926ab1 First changes for better persistent proofs
This commit ensures that clauses now contain
all necessary information to construct the proof
graph (without relying on propagation reasons).
2016-01-21 00:06:41 +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
Guillaume Bury
3f6de07440 Merge branch 'master' into push_pop 2015-11-27 14:53:41 +01:00
Simon Cruanes
15e5a4224d ocp-indent all the files, for the greater good! 2015-11-25 10:04:01 +01:00
Guillaume Bury
5911f18cb4 Res module adapted to accomodate puush/pop 2015-11-19 14:59:54 +01:00
Guillaume Bury
ac5e8a9766 First test (probably unsound) 2015-10-19 22:04:15 +02:00
Guillaume Bury
bbbd407631 Res now includes solver type 2015-10-02 13:30:32 +02: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
4b51f22464 Changed internal representation of proofs 2015-07-09 16:29:57 +02:00
Guillaume Bury
ce05d8fe62 Simpler representation of solver types 2015-06-26 12:58:00 +02:00
Guillaume Bury
6f384fb80b Big refactoring of code. Some performances were lost on pure SAT Solving. 2015-06-25 15:37:29 +02:00
Guillaume Bury
c1af34823c Fix for compilation on older ocaml compiler 2015-03-17 17:33:35 +01:00
Guillaume Bury
5047882fc7 Fix for dependencies during proof computing 2015-03-13 15:03:30 +01:00
Guillaume Bury
d7c5077c0a Log module is passed down to proof module in solvers 2015-03-13 14:09:16 +01:00
Guillaume Bury
1b5038e620 New clauses are memorized, and redundant ones eliminated. 2015-03-10 17:43:41 +01:00
Guillaume Bury
e584e0979d A bit of cleanup of dead code 2015-02-09 17:43:45 +01:00
Guillaume Bury
5f155f6bde Simplified proof generation 2015-02-09 16:07:28 +01:00
Simon Cruanes
c2cfa14e86 small perf change 2015-02-06 17:47:29 +01:00
Guillaume Bury
aee73abd47 Progressing. Conflict clause computing is broken 2014-12-15 17:09:01 +01:00
Guillaume Bury
8e8a592475 Some reorganization of files/folders 2014-12-11 17:02:27 +01:00
Renamed from sat/res.ml (Browse further)