SMT-RAT
24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
|
#include "../datastructures/representation.h"
#include "util.h"
#include "heuristics_cell.h"
#include "heuristics_covering.h"
#include "heuristics_approximation.h"
Go to the source code of this file.
Data Structures | |
struct | smtrat::cadcells::representation::cell< H > |
Note: If connected(i) holds, then the indexed root ordering must contain an ordering between the interval bounds. More... | |
struct | smtrat::cadcells::representation::covering< H > |
Namespaces | |
smtrat | |
Class to create the formulas for axioms. | |
smtrat::cadcells | |
A framework for sample-based CAD algorithms. | |
smtrat::cadcells::representation | |
Heuristics for computing representations. | |
Functions | |
std::ostream & | smtrat::cadcells::representation::operator<< (std::ostream &os, CellHeuristic heuristic) |
std::ostream & | smtrat::cadcells::representation::operator<< (std::ostream &os, CoveringHeuristic heuristic) |
Variables | |
static const char * | smtrat::cadcells::representation::CellHeuristicStrings [] = { "BIGGEST_CELL", "CHAIN_EQ", "LOWEST_DEGREE_BARRIERS", "LOWEST_DEGREE_BARRIERS_EQ", "BIGGEST_CELL_FILTER", "BIGGEST_CELL_FILTER_ONLY_INDEPENDENT", "LOWEST_DEGREE_BARRIERS_FILTER", "LOWEST_DEGREE_BARRIERS_FILTER_ONLY_INDEPENDENT", "BIGGEST_CELL_PDEL", "LOWEST_DEGREE_BARRIERS_PDEL", "LOWEST_DEGREE_BARRIERS_CACHE_GLOBAL" } |
static const char * | smtrat::cadcells::representation::CoveringHeuristicStrings [] = { "BIGGEST_CELL_COVERING", "CHAIN_COVERING", "BIGGEST_CELL_COVERING_FILTER", "BIGGEST_CELL_COVERING_FILTER_ONLY_INDEPENDENT", "BIGGEST_CELL_COVERING_MIN_TDEG", "BIGGEST_CELL_COVERING_PDEL", "LDB_COVERING", "LDB_COVERING_CACHE", "LDB_COVERING_CACHE_GLOBAL" } |