SMT-RAT  24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
Settings.h
Go to the documentation of this file.
1 #pragma once
2 
7 
8 namespace smtrat::qe::coverings {
10  // Variable ordering
12 
13  // Projection operator
18 
19  // Implicant computation
23  auto fe_implicant_ordering = covering_ng::formula::complexity::sotd;
24  std::size_t fe_results = 1;
25  auto fe_constraint_ordering = covering_ng::formula::complexity::min_tdeg;
26  bool fe_stop_evaluation_on_conflict = false;
27  bool fe_preprocess = true;
28  bool fe_postprocess = false;
29  auto fe_boolean_exploration = covering_ng::formula::GraphEvaluation::PROPAGATION;
30  return Type(proj, fe_implicant_ordering, fe_results, fe_constraint_ordering, fe_stop_evaluation_on_conflict, fe_preprocess, fe_postprocess, fe_boolean_exploration);
31  }
32  };
33 };
34 } // namespace smtrat::qe::coverings
Encapsulates all computations on polynomials.
Definition: projections.h:46
bool min_tdeg(cadcells::datastructures::Projections &proj, const cadcells::datastructures::PolyConstraint &a, const cadcells::datastructures::PolyConstraint &b)
bool sotd(cadcells::datastructures::Projections &proj, const boost::container::flat_set< cadcells::datastructures::PolyConstraint > &a, const boost::container::flat_set< cadcells::datastructures::PolyConstraint > &b)
Dolzmann et al 2004.
VariableOrderingHeuristics
Possible heuristics for variable ordering.
covering_ng::formula::GraphEvaluation Type
Definition: Settings.h:21
static auto create(cadcells::datastructures::Projections &proj)
Definition: Settings.h:22
static constexpr cadcells::representation::CoveringHeuristic covering_heuristic
Definition: Settings.h:16
static constexpr cadcells::representation::CellHeuristic cell_heuristic
Definition: Settings.h:15
static constexpr covering_ng::SamplingAlgorithm sampling_algorithm
Definition: Settings.h:17
static constexpr covering_ng::variables::VariableOrderingHeuristics variable_ordering_heuristic
Definition: Settings.h:11