![]() |
SMT-RAT
24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
|
#include "unsat_intervals.h"

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::algorithms | |
| Various algorithms as well as helper functions for developing new algorithms. | |
Functions | |
| template<typename op , representation::CoveringHeuristic covering_heuristic> | |
| std::optional< datastructures::SampledDerivationRef< typename op::PropertiesSet > > | smtrat::cadcells::algorithms::get_level_covering (datastructures::Projections &proj, const std::vector< Atom > &constraints, const Assignment &sample) |
| Computes an unsat covering w.r.t. More... | |