SMT-RAT  24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
Explanation.h
Go to the documentation of this file.
1 #pragma once
2 
3 #include "../utils.h"
4 
7 
8 namespace smtrat {
9 namespace mcsat {
10 namespace onecellcad {
11 namespace levelwise {
12 
13 
15  static constexpr int sectionHeuristic = 1;
16 };
18  static constexpr int sectionHeuristic = 2;
19 };
21  static constexpr int sectionHeuristic = 3;
22 };
23 
25  static constexpr int sectorHeuristic = 1;
26 };
28  static constexpr int sectorHeuristic = 2;
29 };
31  static constexpr int sectorHeuristic = 3;
32 };
33 
34 
35 template<class Setting1, class Setting2>
36 struct Explanation {
37  std::optional<mcsat::Explanation>
38  operator()(const mcsat::Bookkeeping& trail, // current assignment state
39  carl::Variable var,
40  const FormulasT& trailLiterals, bool) const;
41 };
42 
43 } // namespace levelwise
44 } // namespace onecellcad
45 } // namespace mcsat
46 } // namespace smtrat
Represent the trail, i.e.
Definition: Bookkeeping.h:19
int var(Lit p)
Definition: SolverTypes.h:64
Class to create the formulas for axioms.
carl::Formulas< Poly > FormulasT
Definition: types.h:39
std::optional< mcsat::Explanation > operator()(const mcsat::Bookkeeping &trail, carl::Variable var, const FormulasT &trailLiterals, bool) const
Definition: Explanation.cpp:15