ASolverFactory<T extends ISolver> factory
ObjectiveFunction obfct
PBSolverHandle handle
XplainPB quickxplain
int indxConstrObj
int nbOfConstraints
ObjectiveFunction obj
boolean inserted
IVec<T> coeffs
IVecInt vars
BigInteger correction
BigInteger correctionFactor
int indxConstrObj
int nbOfConstraints
ObjectiveFunction obj
boolean inserted
IOptimizationProblem problem
IVecInt assumps
long begin
SolutionFoundListener sfl
BigInteger objectiveValue
int[] prevmodel
int[] prevmodelwithadditionalvars
boolean[] prevfullmodel
IVecInt prevModelBlockingClause
IConstr previousPBConstr
boolean isSolutionOptimal
boolean nonOptimalMeansSatisfiable
boolean useAnImplicantForEvaluation
int solverTimeout
int optimizationTimeout
int indxConstrObj
int nbOfConstraints
ObjectiveFunction obj
boolean inserted
Map<K,V> mapping
IPBConstructor ipbc
ICardConstructor icardc
IClauseConstructor iclausec
BigInteger degree
boolean learnt
BigInteger watchCumul
Map<K,V> litToCoeffs
BigInteger bigDegree
boolean learnt
BigInteger watchCumul
boolean[] watched
int[] watching
int watchingCount
long watchCumul
boolean[] watched
int[] watching
int watchingCount
long watchCumul
boolean[] watched
int[] watching
int watchingCount
double activity
BigInteger[] coefs
BigInteger sumcoefs
BigInteger degree
int[] lits
boolean learnt
ILits voc
double activity
long[] coefs
long sumcoefs
long degree
int[] lits
boolean learnt
ILits voc
Comparator<T> levelBased
double activity
BigInteger[] bigCoefs
BigInteger bigDegree
long[] coefs
long sumcoefs
long degree
int[] lits
boolean learnt
ILits voc
IPBSolver decorated
ObjectiveFunction objf
PBSolverStats pbStats
LearnedConstraintsDeletionStrategy objectiveFunctionBased
boolean noRemove
SkipStrategy skipAllow
IConflictFactory conflictFactory
IPreProcess preprocess
IPostProcess postprocess
IWeakeningStrategy weakeningStrategy
AutoDivisionStrategy autoDivisionStrategy
BumpStrategy bumpStrategy
IBumper bumper
IVec<T> conflictVariables
IVec<T> conflictConstraints
long bound
long numberOfReductions
long numberOfReductionsByPower2
long numberOfRightShiftsForCoeffs
long numberOfReductionsByGCD
long numberOfLearnedConstraintsReduced
long numberOfResolution
long numberOfCP
long numberOfRoundingOperations
long numberOfEasyRoundingOperations
long numberOfEndingSkipping
long numberOfInternalSkipping
long numberOfDerivationSteps
long numberOfRemainingUnassigned
long numberOfRemainingAssigned
long falsifiedLiteralsRemovedFromConflict
long falsifiedLiteralsRemovedFromReason
long timeForArtithmeticOperations
BigInteger minRemoved
BigInteger maxRemoved
int nbRemoved
LearnedConstraintsDeletionStrategy decorated
boolean initConstraintsSet
IIntegerPBSolver integerSolver
BigInteger[] weights
IntegerVariable objBoundVar
List<E> objBoundVariables
List<E> atLeastFlags
BigInteger[] weights
ObjectiveFunction sumObj
ObjectiveFunction lexObj
IConstr lexCstr
IConstr sumCstr
List<E> objs
BigInteger[] weights
IIntegerPBSolver solver
List<E> objBoundVariables
List<E> atLeastFlags
boolean initDone
boolean sumLexStepDone
ObjectiveFunction lexObj
ObjectiveFunction sumObj
ObjectiveFunction owaObj
IConstr additionnalCstr
BigInteger bestValue
PseudoOptDecorator optPb
int[] lastModel
int[] lastModelWithInternalVars
ObjectiveFunction obj
IOrderObjective objorder
ObjectiveFunction obj
IVecInt varExplain
IPBSolver solver
IVecInt lits
IVec<T> coeffs
BigInteger d
String operator
IVecInt objectiveVars
IVec<T> objectiveCoeffs
boolean hasObjFunc
boolean hasVariablesExplanation
int nbVars
int nbConstr
int nbConstraintsRead
char savedChar
boolean charAvailable
boolean eofReached
boolean eolReached
Map<K,V> mapping
boolean isWbo
BigInteger softLimit
boolean softConstraint
LexicoDecoratorPB lexico
BigInteger[] values
int index
BigInteger sum
boolean full
BigIntegerCircularBuffer bufferDegrees
CircularBuffer bufferTrail
BigInteger sumOfAllDegrees
SolverStats stats
IPBSolver solver
String filename
PrintStream out
long index
IPBSolver coSolver
CardConstrFinder cardFinder
Constr extendedConstr
boolean detectCardFromAllConstraintsInCflAnalysis
List<E> objs
BigInteger bigCurrentValue
long bound
long nbModelFound
boolean trivialfalsity
boolean isFirstModel
BigInteger objectiveValue
IPBSolver solver
CardConstrFinder cardFinder
boolean initDone
boolean preprocessing
long preprocessingTime
long preprocessingCardsFound
int solverIndex
int maxAtMostDegree
boolean verbose
Map<K,V> objWeightsMap
BigInteger objMinBound
boolean outputCardsAndExit
boolean toStringRunning
String rissLocation
String instance
IPBSolverService solverService
ObjectiveFunction obj
SolutionFoundListener sfl
BigInteger currentValue
IConstr prevConstr
Copyright © 2020 Centre de Recherche en Informatique de Lens (CRIL). All rights reserved.