SMT-RAT  24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
NewCoveringModule.h File Reference
#include <smtrat-cadcells/datastructures/polynomials.h>
#include <smtrat-cadcells/datastructures/projections.h>
#include <smtrat-cadcells/operators/operator_mccallum.h>
#include <smtrat-cadcells/representation/heuristics.h>
#include "NewCoveringSettings.h"
#include <boost/container/flat_set.hpp>
#include <smtrat-solver/Module.h>
#include <smtrat-cadcells/common.h>
#include <smtrat-mcsat/variableordering/VariableOrdering.h>
#include "Backend.h"
#include "LevelWiseInformation.h"
#include "NewCoveringStatistics.h"
#include "Sampling.h"
#include <carl-arith/ran/Conversion.h>
#include <carl-arith/poly/Conversion.h>
#include <carl-arith/ran/ran.h>
Include dependency graph for NewCoveringModule.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Data Structures

class  smtrat::NewCoveringModule< Settings >
 

Namespaces

 smtrat
 Class to create the formulas for axioms.
 

Detailed Description

Author
Philip Kroll Phili.nosp@m.p.Kr.nosp@m.oll@r.nosp@m.wth-.nosp@m.aache.nosp@m.n.de
Version
2021-07-08 Created on 2021-07-08.

Definition in file NewCoveringModule.h.