-
Notifications
You must be signed in to change notification settings - Fork 0
Internal
Hakan Metin edited this page Oct 17, 2017
·
1 revision
All modern SAT solver uses variables, literals and clauses as datas structure. To be interfaced with any CDCL SAT solver cosy has it own representation.
typedef unsigned int Var;
- 0 means VAR_UNDEF
- start from 1
typedef unsigned int Var;
- 0 means LIT_UNDEF
- start from 1 for positive literal
- start from -1 for negative literal
typedef std::vector<Lit> Clause;
- use classic
std::vector
methods
Here are the methods to configure cosy:
activateLexLeaderForcing();
order(order_type, value_type);
This method actives the lex leader forcing which is disable on the beginning.
This method define the LexLeader.
-
cosy::OrderType::INCREASING
1 2 3 ... n -
cosy::OrderType::CLASS_OCCURENCE
pack variables acording to their orbit, sorted their occurence -
cosy::OrderType::OCCURENCE
sort according to number of occurence of each variables
-
cosy::T_LESS_F
true literal less than false literal -
cosy::F_LESS_T
false literal less than true literal