Menu
▾
▴
Tree [7b02eb] master / History
| File | Date | Author | Commit |
|---|---|---|---|
| src | 2015-05-08 |
Mike
|
[7b02eb] Adding tightness checking (on a constant name b... |
| readme | 2013-11-22 |
Mike
|
[bec6a7] Initial commit |
Read Me
This is the system that handles ONLY multi-valued propositional formulas written with operators -> , <- , <-> , & , | , not. Building the compiler will require flex and bison and a c++ compiler (g++ used in the current build script). For computing the theories when compiled into predicate SM, the run script uses the following software: f2lp gringo clasp as2transitions.
