SMT-RAT  24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
CoveringNGModule.h
Go to the documentation of this file.
1 #pragma once
2 
3 #include <smtrat-solver/Module.h>
4 #include "CoveringNGSettings.h"
5 
6 namespace smtrat {
7 
8 template<typename Settings>
9 class CoveringNGModule : public Module {
10 private:
11 
12 
13 public:
15 
16  CoveringNGModule(const ModuleInput* _formula, Conditionals& _conditionals, Manager* _manager = nullptr);
17 
19 
20  bool informCore(const FormulaT& _constraint);
23  void updateModel() const;
25 };
26 } // namespace smtrat
Answer checkCore()
Checks the received formula for consistency.
CoveringNGModule(const ModuleInput *_formula, Conditionals &_conditionals, Manager *_manager=nullptr)
bool informCore(const FormulaT &_constraint)
bool addCore(ModuleInput::const_iterator _subformula)
void removeCore(ModuleInput::const_iterator _subformula)
void updateModel() const
Updates the model, if the solver has detected the consistency of the received formula,...
Base class for solvers.
Definition: Manager.h:34
The input formula a module has to consider for it's satisfiability check.
Definition: ModuleInput.h:131
super::const_iterator const_iterator
Passing through the list::const_iterator.
Definition: ModuleInput.h:146
A base class for all kind of theory solving methods.
Definition: Module.h:70
Class to create the formulas for axioms.
carl::Formula< Poly > FormulaT
Definition: types.h:37
const settings::Settings & Settings()
Definition: Settings.h:96
Answer
An enum with the possible answers a Module can give.
Definition: types.h:57
std::vector< std::atomic_bool * > Conditionals
A vector of atomic bool pointers.
Definition: types.h:17