SMT-RAT
24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
MAXSMTPBPPStrategy.h
Go to the documentation of this file.
1
#pragma once
2
3
#include <
smtrat-solver/Manager.h
>
4
5
#include <
smtrat-modules/LRAModule/LRAModule.h
>
6
#include <
smtrat-modules/PBPPModule/PBPPModule.h
>
7
#include <
smtrat-modules/SATModule/SATModule.h
>
8
9
10
namespace
smtrat
11
{
12
class
PBPPStrategy
:
13
public
Manager
14
{
15
public
:
16
PBPPStrategy
():
Manager
() {
17
setStrategy
({
18
addBackend<PBPPModule<PBPPSettings1>>(
19
addBackend<SATModule<SATSettings1>>(
20
addBackend<LRAModule<LRASettings1>>()
21
)
22
),
23
});
24
}
25
};
26
}
// namespace smtrat
LRAModule.h
Manager.h
PBPPModule.h
Supports optimization.
SATModule.h
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::PBPPStrategy
Definition:
MAXSMTPBPPStrategy.h:14
smtrat::PBPPStrategy::PBPPStrategy
PBPPStrategy()
Definition:
MAXSMTPBPPStrategy.h:16
smtrat
Class to create the formulas for axioms.
Definition:
handle_options.h:10
smtrat-strategies
strategies
MAXSMTPBPPStrategy.h
Generated by
1.9.1