SMT-RAT
24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
|
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. | |
smtrat::cadcells::operators | |
Projection operators. | |
smtrat::cadcells::operators::rules | |
Implementation of derivation rules. | |
smtrat::cadcells::operators::rules::filter_util | |
Functions | |
std::optional< carl::Interval< RAN > > | smtrat::cadcells::operators::rules::filter_util::delineable_interval (datastructures::Projections &proj, const Assignment &sample, const boost::container::flat_set< datastructures::PolyRef > &polys) |
template<typename P > | |
void | smtrat::cadcells::operators::rules::filter_util::delineable_interval_roots (datastructures::SampledDerivation< P > &deriv, const boost::container::flat_set< datastructures::PolyRef > &polys, const datastructures::PolyRef resultant) |
template<typename P > | |
void | smtrat::cadcells::operators::rules::filter_util::filter_roots (datastructures::DelineatedDerivation< P > &deriv, const datastructures::PolyRef poly, std::function< result(const RAN &)> filter_condition) |
template<typename P > | |
auto | smtrat::cadcells::operators::rules::filter_util::projection_root (const datastructures::DelineatedDerivation< P > &deriv, const RAN &root) |
bool | smtrat::cadcells::operators::rules::filter_util::has_intersection (const RAN &root1, const RAN &root2) |
bool | smtrat::cadcells::operators::rules::filter_util::has_common_real_root (datastructures::Projections &proj, Assignment ass, const datastructures::PolyRef &poly1, const datastructures::PolyRef &poly2) |