Set *getElementRange (Element *element);
void mustHaveValue(Element *element);
-
+
BooleanEdge getBooleanTrue();
BooleanEdge getBooleanFalse();
BooleanEdge applyPredicate(Predicate *predicate, Element **inputs, uint numInputs);
+ /** This exactly one element of array can be true! (i.e. a1 + a2 + a3 + ... + an = 1)*/
+ BooleanEdge applyExactlyOneConstraint (BooleanEdge *array, uint asize);
+
/** This function applies a logical operation to the Booleans in its input. */
-
+
BooleanEdge applyLogicalOperation(LogicOp op, BooleanEdge *array, uint asize);
/** This function applies a logical operation to the Booleans in its input. */
/** When everything is done, the client calls this function and then csolver starts to encode*/
int solve();
-
+ /**
+ * Incremental Solving for SATUNE.
+ * It only supports incremental solving for elements!
+ * No support for BooleanVar, BooleanOrder or using interpreters
+ * @return
+ */
+ int solveIncremental();
+
/** After getting the solution from the SAT solver, client can get the value of an element via this function*/
uint64_t getElementValue(Element *element);
+ void freezeElement(Element *e);
+
/** After getting the solution from the SAT solver, client can get the value of a boolean via this function*/
bool getBooleanValue(BooleanEdge boolean);
void setUnSAT() { model_print("Setting UNSAT %%%%%%\n"); unsat = true; }
void setSatSolverTimeout(long seconds) { satsolverTimeout = seconds;}
bool isUnSAT() { return unsat; }
- bool isBooleanVarUsed(){return booleanVarUsed;}
+ bool isBooleanVarUsed() {return booleanVarUsed;}
void printConstraint(BooleanEdge boolean);
void printConstraints();
Tuner *getTuner() { return tuner; }
SetIteratorBooleanEdge *getConstraints() { return constraints.iterator(); }
-
+ bool isConstraintEncoded(BooleanEdge be) { return encodedConstraints.contains(be);}
+ void addEncodedConstraint(BooleanEdge be) {encodedConstraints.add(be);}
+
SATEncoder *getSATEncoder() {return satEncoder;}
void replaceBooleanWithTrue(BooleanEdge bexpr);
long long getEncodeTime();
long long getSolveTime();
long getSatSolverTimeout() { return satsolverTimeout;}
-
+ bool isIncrementalMode() {return incrementalMode;}
+ void freezeElementsVariables();
CMEMALLOC;
private:
void handleIFFTrue(BooleanLogic *bexpr, BooleanEdge child);
void handleANDTrue(BooleanLogic *bexpr, BooleanEdge child);
void handleFunction(ElementFunction *ef, BooleanEdge child);
-
+
//These two functions are helpers if the client has a pointer to a
//Boolean object that we have since replaced
BooleanEdge rewriteLogicalOperation(LogicOp op, BooleanEdge *array, uint asize);
BooleanEdge doRewrite(BooleanEdge b);
/** This is a vector of constraints that must be satisfied. */
HashsetBooleanEdge constraints;
+ HashsetBooleanEdge encodedConstraints;
/** This is a vector of all boolean structs that we have allocated. */
Vector<Boolean *> allBooleans;
SATEncoder *satEncoder;
bool unsat;
- bool booleanVarUsed;
- Tuner *tuner;
+ bool booleanVarUsed;
+ bool incrementalMode;
+ Tuner *tuner;
long long elapsedTime;
long satsolverTimeout;
Interpreter *interpreter;