![]() |
SMT-RAT
24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
|
#include <algorithm>#include <variant>#include <vector>#include <smtrat-common/smtrat-common.h>#include <smtrat-common/types.h>#include <carl-arith/core/Variable.h>#include <carl-arith/ran/Conversion.h>#include <smtrat-cadcells/operators/operator.h>#include <smtrat-coveringng/Algorithm.h>#include "Settings.h"#include "smtrat-cadcells/datastructures/roots.h"#include "smtrat-coveringng/VariableOrdering.h"

Go to the source code of this file.
Namespaces | |
| smtrat | |
| Class to create the formulas for axioms. | |
| smtrat::qe | |
| smtrat::qe::coverings | |
Typedefs | |
| using | smtrat::qe::coverings::Settings = DefaultSettings |
Functions | |
| std::optional< FormulaT > | smtrat::qe::coverings::qe (const FormulaT &input) |