| Age | Commit message (Expand) | Author |
|---|---|---|
| 2013-05-23 | Refactoring to prepare for MBQI with integer quantification. Minor bug fixes. | Andrew Reynolds |
| 2013-05-22 | Significant work on bounded integer quantification to handle non-trivial boun... | Andrew Reynolds |
| 2013-05-14 | Refactoring to separate old and new model building/checking code. | Andrew Reynolds |
| 2013-05-11 | Preliminary version of finite model finding over bounded integer quantificati... | Andrew Reynolds |
| 2013-05-09 | Add simplification option --fo-prop-quant. Add model support for new model-c... | Andrew Reynolds |
| 2013-05-08 | Add new method for checking candidate models, --fmf-fmc. Add infrastructure ... | Andrew Reynolds |
 |
index : cvc5.git | |
| CVC4 is an efficient open-source automatic theorem prover for satisfiability modulo theories (SMT) problems. | git repository hosting |
| summaryrefslogtreecommitdiff |
generated by cgit on debian on lair
contact matthew@masot.net with questions or feedback