4 commits

Author	SHA1	Message	Date
Simon Cruanes	e1717f3afe	wip: heavy refactoring of SAT solver, making most things backtrackable ... the idea is that most changes should be undone upon backtracking, using the global `on_backtrack` command and `at_level_0` to know when something is going to be permanent. In particular, should be (possibly optionally) undone on backtracking: - addition of clauses (clauses being attached) - propagations of atoms - addition of literals to the heap - internalization of literals (tbd) clauses should also be added immediately, not pushed into a queue	2018-02-11 22:58:24 -06:00
Simon Cruanes	7b44146102	make it compile! with stubs for conversion parse ast -> ast -> term	2018-02-08 22:19:32 -06:00
Simon Cruanes	d73684902f	wip: have a proper smtlib parser	2018-02-05 23:09:29 -06:00
Simon Cruanes	221ed7dcdb	continue large refactoring, progress in theory combination ... - first draft of theory combination - theory interface - have the project compile	2018-02-01 22:53:06 -06:00