![]() |
SMT-RAT
24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
|
#include <map>#include <limits.h>#include "Substitution.h"#include <carl-common/memory/IDPool.h>#include <smtrat-variablebounds/VariableBounds.h>#include "VSSettings.h"

Go to the source code of this file.
Data Structures | |
| struct | smtrat::vs::unsignedTripleCmp |
| class | smtrat::vs::State |
Namespaces | |
| smtrat | |
| Class to create the formulas for axioms. | |
| smtrat::vs | |
Macros | |
| #define | VS_STATE_DEBUG_METHODS |
| Class to create a decision tuple object. More... | |
Typedefs | |
| typedef std::set< carl::PointerSet< Condition > > | smtrat::vs::ConditionSetSet |
| typedef std::set< ConditionSetSet > | smtrat::vs::ConditionSetSetSet |
| typedef std::list< const Condition * > | smtrat::vs::ConditionList |
| typedef std::vector< ConditionList > | smtrat::vs::DisjunctionOfConditionConjunctions |
| typedef std::pair< size_t, std::pair< size_t, size_t > > | smtrat::vs::UnsignedTriple |
| typedef std::pair< UnsignedTriple, vs::State * > | smtrat::vs::ValStatePair |
| typedef std::map< UnsignedTriple, vs::State *, unsignedTripleCmp > | smtrat::vs::ValuationMap |