SMT-RAT  24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
common.h File Reference
#include <smtrat-common/smtrat-common.h>
#include <smtrat-common/model.h>
#include <carl-arith/ran/ran.h>
#include <carl-arith/poly/libpoly/LPPolynomial.h>
Include dependency graph for common.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Namespaces

 smtrat
 Class to create the formulas for axioms.
 
 smtrat::cadcells
 A framework for sample-based CAD algorithms.
 

Typedefs

using smtrat::cadcells::VariableOrdering = std::vector< carl::Variable >
 
using smtrat::cadcells::Polynomial = carl::ContextPolynomial< Rational >
 
using smtrat::cadcells::Constraint = carl::BasicConstraint< Polynomial >
 
using smtrat::cadcells::MultivariateRoot = carl::MultivariateRoot< Polynomial >
 
using smtrat::cadcells::VariableComparison = carl::VariableComparison< Polynomial >
 
using smtrat::cadcells::Atom = std::variant< Constraint, VariableComparison >
 
using smtrat::cadcells::Disjunction = std::vector< Atom >
 
using smtrat::cadcells::DNF = std::vector< Disjunction >
 
using smtrat::cadcells::RAN = Polynomial::RootType
 
using smtrat::cadcells::Assignment = carl::Assignment< RAN >
 

Variables

static const Assignment smtrat::cadcells::empty_assignment