mirror of
https://github.com/Z3Prover/z3
synced 2025-08-25 12:35:59 +00:00
First try to generalize variable elimination
This commit is contained in:
parent
adc9f7abe4
commit
98d572b48b
9 changed files with 218 additions and 31 deletions
|
@ -224,6 +224,7 @@ namespace polysat {
|
|||
void learn_lemma(clause& lemma);
|
||||
void backjump(unsigned new_level);
|
||||
void add_clause(clause& clause);
|
||||
void add_clause(signed_constraint c, bool is_redundant);
|
||||
void add_clause(signed_constraint c1, signed_constraint c2, bool is_redundant);
|
||||
void add_clause(signed_constraint c1, signed_constraint c2, signed_constraint c3, bool is_redundant);
|
||||
void add_clause(signed_constraint c1, signed_constraint c2, signed_constraint c3, signed_constraint c4, bool is_redundant);
|
||||
|
@ -309,7 +310,7 @@ namespace polysat {
|
|||
|
||||
/** Create expression for the logical left shift of p by q. */
|
||||
pdd shl(pdd const& p, pdd const& q) { return m_constraints.shl(p, q); }
|
||||
|
||||
|
||||
/** Create expression for the bit-wise negation of p. */
|
||||
pdd bnot(pdd const& p) { return m_constraints.bnot(p); }
|
||||
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue