SMT-RAT  24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
ContractionCandidate.cpp
Go to the documentation of this file.
1 #include "ContractionCandidate.h"
2 #include "IcpVariable.h"
3 
4 namespace smtrat
5 {
6  namespace icp{
7 
8 #ifdef __VS
9  const double ContractionCandidate::mAlpha = 0.9;
10 #endif
11 
13  {
14  if( mOrigin.empty() )
15  {
16  for( IcpVariable* icpVar : mIcpVariables )
17  icpVar->incrementActivity();
18  }
19  assert(_origin.type() == carl::FormulaType::CONSTRAINT);
20  mOrigin.insert(_origin);
21  }
22 
24  {
25  mOrigin.erase(_origin);
26  if( mOrigin.empty() )
27  {
28  for( IcpVariable* icpVar : mIcpVariables )
29  icpVar->decrementActivity();
30  }
31  }
32  }
33 }
void removeOrigin(const FormulaT &_origin)
std::set< IcpVariable * > mIcpVariables
void addOrigin(const FormulaT &_origin)
Class to create the formulas for axioms.
carl::Formula< Poly > FormulaT
Definition: types.h:37