SMT-RAT
24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
PPDefault.h
Go to the documentation of this file.
1
#pragma once
2
3
#include <
smtrat-modules/CoveringNGModule/CoveringNGModule.h
>
4
#include <
smtrat-modules/FPPModule/FPPModule.h
>
5
#include <
smtrat-solver/Manager.h
>
6
7
namespace
smtrat
{
8
9
/**
10
* The most efficient CoveringNG strategy with preprocessing.
11
*
12
*/
13
class
CoveringNG_PPDefault
:
public
Manager
{
14
public
:
15
CoveringNG_PPDefault
() :
Manager
() {
16
setStrategy
(
17
addBackend
<
FPPModule<FPPSettings1>
>({
18
addBackend<CoveringNGModule<CoveringNGSettingsDefault>>()
19
})
20
);
21
}
22
};
23
}
// namespace smtrat
CoveringNGModule.h
FPPModule.h
Manager.h
smtrat::CoveringNG_PPDefault
The most efficient CoveringNG strategy with preprocessing.
Definition:
PPDefault.h:13
smtrat::CoveringNG_PPDefault::CoveringNG_PPDefault
CoveringNG_PPDefault()
Definition:
PPDefault.h:15
smtrat::FPPModule
Definition:
FPPModule.h:18
smtrat::Manager
Base class for solvers.
Definition:
Manager.h:34
smtrat::Manager::setStrategy
void setStrategy(const std::initializer_list< BackendLink > &backends)
Definition:
Manager.h:385
smtrat::Manager::addBackend
BackendLink addBackend(const std::initializer_list< BackendLink > &backends={})
Definition:
Manager.h:396
smtrat
Class to create the formulas for axioms.
Definition:
handle_options.h:10
smtrat-strategies
strategies
CoveringNG
PPDefault.h
Generated by
1.9.1