SMT-RAT
24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
|
#include <CAD.h>
Public Types | |
using | SettingsT = Settings |
Public Member Functions | |
CAD () | |
~CAD () | |
std::size_t | dim () const |
const auto & | getVariables () const |
const auto & | getProjection () const |
const auto & | getLifting () const |
const auto & | getConstraints () const |
const auto & | getConstraintMap () const |
bool | isIdValid (std::size_t id) const |
const auto & | getBounds () const |
void | reset (const std::vector< carl::Variable > &vars) |
void | addConstraint (const ConstraintT &c) |
void | removeConstraint (const ConstraintT &c) |
template<typename ConstraintIt > | |
bool | evaluateSample (Sample &sample, const ConstraintIt &constraint, Assignment &assignment) const |
std::vector< Assignment > | enumerateSolutions () |
Answer | checkFullSamples (Assignment &assignment) |
template<typename Iterator > | |
Answer | checkPartialSample (Iterator &it, std::size_t level) |
Answer | check (Assignment &assignment, std::vector< FormulaSetT > &mis) |
ConflictGraph | generateConflictGraph () const |
auto | generateCovering () const |
Data Fields | |
debug::TikzHistoryPrinter | thp |
Private Member Functions | |
std::size_t | idPL (std::size_t level) const |
std::size_t | idLP (std::size_t level) const |
Private Attributes | |
std::vector< carl::Variable > | mVariables |
CADConstraints< Settings::backtracking > | mConstraints |
ProjectionT< Settings > | mProjection |
LiftingTree< Settings > | mLifting |
Friends | |
template<CoreHeuristic CH> | |
struct | CADCore |
using smtrat::cad::CAD< Settings >::SettingsT = Settings |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inlineprivate |
|
inlineprivate |
|
inline |
|
inline |
|
inline |
|
private |
|
private |
|
private |
|
private |
debug::TikzHistoryPrinter smtrat::cad::CAD< Settings >::thp |