![]() |
SMT-RAT
24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
|
#include <smtrat-common/smtrat-common.h>#include <carl-formula/model/Model.h>#include <smtrat-solver/Module.h>

Go to the source code of this file.
Data Structures | |
| class | smtrat::maxsmt::MaxSMTBackend< Solver, Strategy > |
| class | smtrat::MaxSMT< Solver, Strategy > |
Namespaces | |
| smtrat | |
| Class to create the formulas for axioms. | |
| smtrat::maxsmt | |
| Contains strategy implementations for max SMT computations. | |
Enumerations | |
| enum class | smtrat::MaxSMTStrategy { smtrat::FU_MALIK_INCREMENTAL , smtrat::MSU3 , smtrat::LINEAR_SEARCH } |
Functions | |
| std::ostream & | smtrat::operator<< (std::ostream &os, MaxSMTStrategy ucs) |