simon/sidekick
1
0
Fork 0
mirror of https://github.com/c-cube/sidekick.git synced 2025-12-10 13:14:09 -05:00
Code Issues Projects Releases Packages Wiki Activity Actions
949 commits 53 branches 1 tag 17 MiB
Commit graph

19 commits

Author SHA1 Message Date
Simon Cruanes
14bb5898f0 Merge branch 'wip-fix-lra' into wip-lra-simplex-unsat-core 2020-12-22 11:46:09 -05:00
Simon Cruanes
5ca4730968 try to fix build 2020-12-22 11:06:59 -05:00
Simon Cruanes
3b3a2e1caf use simplex conflicts in LRA 2020-12-22 10:55:55 -05:00
Guillaume Bury
4be726db43 Add unsat core explanations to the simplex 2020-12-22 14:16:23 +01:00
Simon Cruanes
9d579af235 wip: make lazyness of model explicit 2020-12-21 16:15:49 -05:00
Simon Cruanes
b3a7acf95b feat(LRA): handle congruence closure and theory combination in LRA 
- merges in the CC are handled by adding corresponding equalities
  locally
- theory combination pushes the decision `a=b` into the SAT solver
  if a,b have the same model values and are not provably equal
  in the CC already.
- also, fix model construction
 2020-11-17 18:24:09 -05:00
Simon Cruanes
6a0731eeb1 refactor: improve model production in FM 2020-11-17 17:03:12 -05:00
Simon Cruanes
db1c50f7ed feat(LRA): expose model after fourier-motzkin returns "SAT" 2020-11-17 16:52:49 -05:00
Simon Cruanes
103c320577 fix(lra): fixed case splitting on a != b 2020-11-14 00:23:45 -05:00
Simon Cruanes
b2ab465cff fix(LRA): track explanations properly when rewriting with an equality 2020-11-13 23:58:14 -05:00
Simon Cruanes
a6f6a99fb3 fix: small perf improvement 2020-11-13 23:28:39 -05:00
Simon Cruanes
39ed753b38 add tests for simplex 2020-11-13 23:28:32 -05:00
Simon Cruanes
5ff0fff85b wip: refactor(lra): import Simplex from funarith, replace FM with it 2020-11-13 22:35:59 -05:00
Simon Cruanes
df25e84a01 fix(LRA): fix bug in FM resolution; add more comments 2020-11-12 19:23:45 -05:00
Simon Cruanes
0fc5b279d1 fix(LRA): invalid normalization 2020-11-12 18:46:43 -05:00
Simon Cruanes
3e703cf89e refactor: better debug in LRA 2020-11-12 18:46:34 -05:00
Simon Cruanes
9a3e387405 refactor: explicit recursion in preprocessing 
if a preprocessor fires, it's up to it to preprocess subterms. rewriting
is now from the root, not the leaves on.

Use that in LRA to rewrite under linear expressions.
 2020-11-12 18:21:37 -05:00
Simon Cruanes
3449404964 refactor: move base-term to sidekick-arith 2020-10-10 17:43:42 -04:00
Simon Cruanes
349d884664 chore: add sidekick-arith library, depends on zarith 2020-10-10 17:18:20 -04:00