SMT-RAT  24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
NewCoveringSettings.h
Go to the documentation of this file.
1 /**
2  * @file NewCoveringSettings.h
3  * @author Philip Kroll <Philip.Kroll@rwth-aachen.de>
4  *
5  * @version 2021-07-08
6  * Created on 2021-07-08.
7  */
8 
9 #pragma once
10 
11 #include "Sampling.h"
15 
16 
17 
18 namespace smtrat {
19 
21  static constexpr char moduleName[] = "NewCoveringModule<NewCovering>";
27  static constexpr bool incremental = true;
28  static constexpr bool backtracking = true;
29 };
30 
32  static constexpr bool backtracking = false;
33 };
34 
36  static constexpr bool incremental = false;
37 };
38 
40  static constexpr bool incremental = false;
41  static constexpr bool backtracking = false;
42 };
43 
44 } // namespace smtrat
Class to create the formulas for axioms.
IsSampleOutsideAlgorithm
Definition: Sampling.h:21
@ DEFAULT
Definition: Sampling.h:22
SamplingAlgorithm
Definition: Sampling.h:17
@ LOWER_UPPER_BETWEEN_SAMPLING
Definition: Sampling.h:18
static constexpr smtrat::SamplingAlgorithm sampling_algorithm
static constexpr bool incremental
static constexpr char moduleName[]
static constexpr mcsat::VariableOrdering variableOrderingStrategy
static constexpr smtrat::cadcells::representation::CoveringHeuristic covering_heuristic
static constexpr bool backtracking
static constexpr smtrat::IsSampleOutsideAlgorithm is_sample_outside_algorithm
static constexpr bool backtracking
static constexpr bool incremental
static constexpr bool backtracking
static constexpr bool incremental