mirror of
https://github.com/c-cube/sidekick.git
synced 2025-12-08 20:25:31 -05:00
25 lines
936 B
Markdown
25 lines
936 B
Markdown
# Goals
|
|
|
|
## Main goals
|
|
|
|
- Include cnf conversion in 'sat' library
|
|
- Modify theories to allow passing bulk of assumed literals
|
|
* Create shared "vector" (formulas/atoms ?)
|
|
* Allow theory propagation
|
|
- Cleanup code
|
|
* Simplify Solver.Make functor
|
|
* Clean Solver_types interface
|
|
- Add proof output as resolution
|
|
* Each theory brings its own proof output (tautologies), somehow
|
|
* pure resolution proofs between boolean clauses and theory tautologies
|
|
- Add model extraction (at least for SAT)
|
|
- Allow to plug one's code into boolean propagation
|
|
* react upon propagation (possibly by propagating more, or side-effect)
|
|
* 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
|
|
|
|
- unsat-core (easy from resolution proofs)
|
|
- max-sat/max-smt
|