SMT-RAT  24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
greedy_max_univariate.h File Reference
#include "helper.h"
#include <carl-arith/core/Variable.h>
#include <carl-common/datastructures/Bitset.h>
#include <smtrat-common/smtrat-common.h>
#include <algorithm>
#include <map>
#include <vector>
Include dependency graph for greedy_max_univariate.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Namespaces

 smtrat
 Class to create the formulas for axioms.
 
 smtrat::mcsat
 
 smtrat::mcsat::variableordering
 
 smtrat::mcsat::variableordering::detail
 

Functions

carl::Bitset smtrat::mcsat::variableordering::detail::variablesOf (const ConstraintT &c, VariableIDs &vids)
 
long smtrat::mcsat::variableordering::detail::countUnivariates (const std::vector< carl::Bitset > &constraints, std::size_t id)
 
bool smtrat::mcsat::variableordering::detail::stillOccurs (const std::vector< carl::Bitset > &constraints, std::size_t id)
 
carl::Variable smtrat::mcsat::variableordering::detail::findMax (const std::vector< carl::Bitset > &constraints, const VariableIDs &vids)
 
void smtrat::mcsat::variableordering::detail::purgeVariable (std::vector< carl::Bitset > &constraints, carl::Variable v, const VariableIDs &vids)
 
template<typename Constraints >
std::vector< carl::Variable > smtrat::mcsat::variableordering::greedy_max_univariate (const Constraints &c)