mirror of
https://github.com/Z3Prover/z3
synced 2025-09-05 09:37:44 +00:00
extract multiple bounds for upper/lower bound
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
parent
9275930f50
commit
50cbe2659a
4 changed files with 85 additions and 45 deletions
|
@ -120,8 +120,9 @@ namespace polysat {
|
|||
// i := x + y >= x or x + y > x
|
||||
bool is_add_overflow(pvar x, inequality const& i, pdd& y);
|
||||
|
||||
bool has_upper_bound(pvar x, conflict& core, rational& bound, signed_constraint& x_ge_bound);
|
||||
bool has_lower_bound(pvar x, conflict& core, rational& bound, signed_constraint& x_le_bound);
|
||||
bool has_upper_bound(pvar x, conflict& core, rational& bound, vector<signed_constraint>& x_ge_bound);
|
||||
|
||||
bool has_lower_bound(pvar x, conflict& core, rational& bound, vector<signed_constraint>& x_le_bound);
|
||||
|
||||
// determine min/max parity of polynomial
|
||||
unsigned min_parity(pdd const& p);
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue