SMT-RAT
24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
Default.h
Go to the documentation of this file.
1
#pragma once
2
3
#include <
smtrat-modules/CoveringNGModule/CoveringNGModule.h
>
4
#include <
smtrat-solver/Manager.h
>
5
6
namespace
smtrat
{
7
8
/**
9
* The most efficient CoveringNG strategy with preprocessing.
10
*
11
*/
12
class
CoveringNG_Default
:
public
Manager
{
13
public
:
14
CoveringNG_Default
() :
Manager
() {
15
setStrategy
(
16
addBackend
<
CoveringNGModule<CoveringNGSettingsDefault>
>()
17
);
18
}
19
};
20
}
// namespace smtrat
CoveringNGModule.h
Manager.h
smtrat::CoveringNGModule
Definition:
CoveringNGModule.h:9
smtrat::CoveringNG_Default
The most efficient CoveringNG strategy with preprocessing.
Definition:
Default.h:12
smtrat::CoveringNG_Default::CoveringNG_Default
CoveringNG_Default()
Definition:
Default.h:14
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
Default.h
Generated by
1.9.1