|
libgsjj
1
Deterministic finite automata learning library
|
Contains every method that relies on a SAT solver that works on any boolean formula. More...
Classes | |
| class | BinaryNonCNFMethod |
| The Grinchtein, Leucker and Piterman's binary method using a SAT Solver that does not rely on CNF. More... | |
| class | HeuleVerwerNonCNFMethod |
| The Heule and Verwer method. More... | |
| class | SATNonCNFMethod |
| Base class for every method that relies on a non-CNF SAT solver. More... | |
| class | UnaryNonCNFMethod |
| The Grinchtein, Leucker and Piterman's unary method. More... | |
Contains every method that relies on a SAT solver that works on any boolean formula.
These methodes use limboole.
1.8.13