diff options
| author | Alan Mishchenko <alanmi@berkeley.edu> | 2013-04-28 01:25:29 -0700 |
|---|---|---|
| committer | Alan Mishchenko <alanmi@berkeley.edu> | 2013-04-28 01:25:29 -0700 |
| commit | b09926e8e26de8df20a3973a3c9a1c63b06952cb (patch) | |
| tree | cd38678012538f93611262f680e00d7f12a83ba4 /src/proof/ssc/ssc.h | |
| parent | 17a0d944b305cbadeb2bbbcdd7ef3c82b50c3c7a (diff) | |
| download | abc-b09926e8e26de8df20a3973a3c9a1c63b06952cb.tar.gz abc-b09926e8e26de8df20a3973a3c9a1c63b06952cb.tar.bz2 abc-b09926e8e26de8df20a3973a3c9a1c63b06952cb.zip | |
SAT sweeping under constraints.
Diffstat (limited to 'src/proof/ssc/ssc.h')
| -rw-r--r-- | src/proof/ssc/ssc.h | 1 |
1 files changed, 1 insertions, 0 deletions
diff --git a/src/proof/ssc/ssc.h b/src/proof/ssc/ssc.h index de32ffc1..1112719c 100644 --- a/src/proof/ssc/ssc.h +++ b/src/proof/ssc/ssc.h @@ -47,6 +47,7 @@ struct Ssc_Pars_t_ int nBTLimit; // conflict limit at a node int nSatVarMax; // the max number of SAT variables int nCallsRecycle; // calls to perform before recycling SAT solver + int fAppend; // append constraints to the resulting AIG int fVerbose; // verbose stats }; |