SMT-RAT
24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
qe.h
Go to the documentation of this file.
1
#pragma once
2
3
#include <algorithm>
4
#include <variant>
5
#include <vector>
6
7
#include <
smtrat-common/smtrat-common.h
>
8
#include <
smtrat-common/types.h
>
9
#include <carl-arith/core/Variable.h>
10
#include <carl-arith/ran/Conversion.h>
11
#include <
smtrat-cadcells/operators/operator.h
>
12
#include <
smtrat-coveringng/Algorithm.h
>
13
14
#include "
Settings.h
"
15
#include "
smtrat-cadcells/datastructures/roots.h
"
16
#include "
smtrat-coveringng/VariableOrdering.h
"
17
18
namespace
smtrat::qe::coverings
{
19
20
using
Settings
=
DefaultSettings
;
21
22
std::optional<FormulaT>
qe
(
const
FormulaT
& formula);
23
24
}
// namespace smtrat::qe::coverings
Algorithm.h
smtrat::qe::coverings
Definition:
qe.cpp:12
smtrat::qe::coverings::qe
std::optional< FormulaT > qe(const FormulaT &input)
Definition:
qe.cpp:14
smtrat::FormulaT
carl::Formula< Poly > FormulaT
Definition:
types.h:37
operator.h
roots.h
types.h
smtrat-common.h
VariableOrdering.h
Settings.h
smtrat::qe::coverings::DefaultSettings
Definition:
Settings.h:9
smtrat-qe
coverings
qe.h
Generated by
1.9.1