TODO update.

This commit is contained in:
Guillaume Bury 2014-11-01 20:20:53 +01:00
parent 088fc05fac
commit 709ea9740e

12
TODO.md
View file

@ -2,9 +2,13 @@
## Main goals ## Main goals
- Functorise `solver.ml` with term module and theory module - Include cnf conversion in 'sat' library
* SAT solver depends on actual boolean literals - Modify theories to allow passing bulk of assumed literals
* Move terms and theories (SMT part) to another directory * Create shared "vector" (formulas/atoms ?)
* Allow theory propagation
- Cleanup code
* Simplify Solver.Make functor
* Clean Solver_types interface
- Add proof output as resolution - Add proof output as resolution
* Each theory brings its own proof output (tautologies), somehow * Each theory brings its own proof output (tautologies), somehow
* pure resolution proofs between boolean clauses and theory tautologies * pure resolution proofs between boolean clauses and theory tautologies
@ -12,6 +16,8 @@
- Allow to plug one's code into boolean propagation - Allow to plug one's code into boolean propagation
* react upon propagation (possibly by propagating more, or side-effect) * react upon propagation (possibly by propagating more, or side-effect)
* more advanced/specific propagation (2-clauses)? * more advanced/specific propagation (2-clauses)?
* implement 'constraints' (see https://www.lri.fr/~conchon/TER/2013/3/minisat.pdf )
- Adapt old code for theories, inorder to plug it into new Solver Functor
## Long term goals ## Long term goals