SMT-RAT  24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
utils.cpp File Reference
#include <cmath>
#include <map>
#include "utils.h"
Include dependency graph for utils.cpp:

Go to the source code of this file.

Namespaces

 smtrat
 Class to create the formulas for axioms.
 
 smtrat::icp
 

Functions

std::vector< Poly > smtrat::icp::getNonlinearMonomials (const Poly &_expr)
 Obtains the non-linear monomials of the given polynomial. More...
 
std::pair< ConstraintT, ConstraintT > smtrat::icp::intervalToConstraint (const Poly &_lhs, const smtrat::DoubleInterval _interval)
 Creates a new constraint from an existing interval. More...
 
bool smtrat::icp::intervalBoxContainsEmptyInterval (const EvalDoubleIntervalMap &_intervals)
 Checks mIntervals if it contains an empty interval. More...
 
const LRAModule< LRASettings1 >::LRAVariable * smtrat::icp::getOriginalLraVar (carl::Variable::Arg _var, const LRAModule< LRASettings1 > &_lra)