private void readObject(ObjectInputStream stream) throws IOException, ClassNotFoundException
IOException
ClassNotFoundException
long beginTime
ExitCode exitCode
Reader reader
boolean displaySolutionLine
ISolver solver
IProblem problem
boolean silent
boolean prime
ILauncherMode launcherMode
ASolverFactory<T extends ISolver> factory
IVecInt vec
int nbelem
Object[] myarray
ILits lits
IVec<T> tmp
UnitPropagationListener solver
Learner learner
int maxUnsatisfied
int counter
int[] lits
ILits voc
int degree
int[] lits
boolean moreThan
int watchCumul
ILits voc
int degree
int[] lits
boolean moreThan
int watchCumul
ILits voc
double activity
ILits voc
int head
int tail
double activity
int[] middleLits
ILits voc
int head
int tail
double activity
int[] lits
ILits voc
int backtrackLevel
Constr reason
ILogAble out
IVec<T> constrs
IVec<T> learnts
double claInc
double claDecay
int qhead
IVecInt trail
IVecInt trailLim
int rootLevel
int[] model
ILits voc
IOrder order
ActivityComparator comparator
SolverStats stats
LearningStrategy<D extends DataStructureFactory> learner
boolean undertimeout
long timeout
boolean timeBasedTimeout
DataStructureFactory dsfactory
SearchParams params
IVecInt __dimacs_out
SearchListener<S extends ISolverService> slistener
RestartStrategy restarter
Map<K,V> constrTypes
boolean isDBSimplificationAllowed
IVecInt learnedLiterals
boolean verbose
boolean keepHot
String prefix
int declaredMaxVarId
boolean[] mseen
IVecInt mpreason
IVecInt moutLearnt
ISimplifier SIMPLE_SIMPLIFICATION
ISimplifier EXPENSIVE_SIMPLIFICATION
ISimplifier EXPENSIVE_SIMPLIFICATION_WLONLY
ISimplifier simplifier
IVecInt analyzetoclear
IVecInt analyzestack
IVec<T> watched
Pair analysisResult
boolean[] userbooleanmodel
IVecInt unsatExplanationInTermsOfAssumptions
IVecInt implied
IVecInt decisions
int[] fullmodel
int[] prime
double timebegin
boolean needToReduceDB
ConflictTimerContainer conflictCount
ConflictTimer memoryTimer
LearnedConstraintsDeletionStrategy memory_based
ConflictTimer lbdTimer
LearnedConstraintsDeletionStrategy glucose
LearnedConstraintsDeletionStrategy learnedConstraintsDeletionStrategy
boolean lastConflictMeansUnsat
Constr sharedConflict
int starts
long decisions
long propagations
long inspects
long conflicts
long learnedliterals
long learnedbinaryclauses
long learnedternaryclauses
long learnedclauses
long ignoredclauses
long rootSimplifications
long reducedliterals
long changedreason
int reduceddb
int shortcuts
long updateLBD
double percent
IOrder order
int maxpercent
NoLearningButHeuristics<D extends DataStructureFactory> none
MiniSATLearning<D extends DataStructureFactory> all
ILits lits
SolverStats stats
DataStructureFactory dsf
VarOrderHeap decorated
double p
ILits voc
int nbRandomWalks
double[] activity
double varDecay
double varInc
ILits lits
long nullchoice
Heap heap
IPhaseSelectionStrategy phaseStrategy
double inner
double outer
long conflicts
SearchParams params
long conflictcount
CircularBuffer bufferLBD
CircularBuffer bufferTrail
long sumOfAllLBD
SolverStats stats
double nofConflicts
SearchParams params
int conflictcount
int expectedNbOfConstr
ISolver solver
boolean checkConstrNb
String formatString
EfficientScanner scanner
IVecInt literals
int numberOfComponents
IGroupSolver groupSolver
int currentComponentIndex
ISolver s
int nbVars
int nbClauses
int lastCreatedVar
boolean pooledVarId
org.sat4j.tools.AbstractClauseSelectorSolver.SelectorState external
org.sat4j.tools.AbstractClauseSelectorSolver.SelectorState internal
org.sat4j.tools.AbstractClauseSelectorSolver.SelectorState selectedState
IVecInt pLiterals
SolutionFoundListener modelListener
EncodingStrategyAdapter encodingAdapter
int counter
int nVar
IVisualizationTool conflictDepthVisu
IVisualizationTool conflictDepthRestartVisu
IVisualizationTool conflictDepthCleanVisu
int counter
int nVar
int maxDLevel
IVisualizationTool visuTool
IVisualizationTool restartVisuTool
IVisualizationTool cleanTool
int counter
IVisualizationTool visuTool
int counter
IVisualizationTool positiveVisu
IVisualizationTool negativeVisu
IVisualizationTool restartVisu
IVisualizationTool cleanVisu
int nVar
ISolver solver
private void readObject(ObjectInputStream stream)
StringBuffer out
int firstCharPos
int initBuilderSize
int maxvarid
private void readObject(ObjectInputStream stream) throws IOException, ClassNotFoundException
IOException
ClassNotFoundException
GateTranslator gater
String filename
PrintStream out
ISolverService solverService
IVisualizationTool visuTool
IVisualizationTool visuTool
int counter
IVisualizationTool visuTool
int counter
IVisualizationTool visuTool
IVisualizationTool restartTool
IVisualizationTool cleanTool
int counter
int maxSize
ISolverService solverService
IVisualizationTool visuTool
int[] lastModel
SolutionFoundListener sfl
Collection<E> listeners
Collection<E> addedVars
IOptimizationProblem problem
boolean modelComputed
boolean optimalValueForced
ISolverService solverService
int nbsolutions
SolutionFoundListener sfl
ISolverService solverService
SolutionFoundListener sfl
ISolver solver
IVisualizationTool visuTool
IVisualizationTool cleanVisuTool
IVisualizationTool restartVisuTool
long begin
long end
int counter
long index
double maxY
int expectedNumberOfConstraints
int nbvars
IVecInt[] sizeoccurrences
int allpositive
int allnegative
int horn
int dualhorn
Map<K,V> sizes
Sequential seq
Binary binary
Product product
Commander commander
Binomial binomial
Ladder ladder
EncodingStrategyAdapter atMostOneEncoding
EncodingStrategyAdapter atMostKEncoding
EncodingStrategyAdapter exactlyOneEncoding
EncodingStrategyAdapter exactlyKEncoding
EncodingStrategyAdapter atLeastOneEncoding
EncodingStrategyAdapter atLeastKEncoding
IVecInt assump
MinimizationStrategy xplainStrategy
IVecInt assump
MinimizationStrategy xplainStrategy
Copyright © 2013 Centre de Recherche en Informatique de Lens (CRIL). All Rights Reserved.