SMT-RAT
24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
|
A module, which searches for bounds of arithmetic variables and polynomials. More...
#include <smtrat-solver/PModule.h>
#include "BESettings.h"
#include <carl-formula/formula/functions/ConstraintBounds.h>
Go to the source code of this file.
Data Structures | |
class | smtrat::BEModule< Settings > |
Namespaces | |
smtrat | |
Class to create the formulas for axioms. | |
A module, which searches for bounds of arithmetic variables and polynomials.
Definition in file BEModule.h.