mirror of
https://github.com/Z3Prover/z3
synced 2025-10-16 04:20:25 +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
|
@ -189,13 +189,13 @@ namespace polysat {
|
|||
* Query for an upper bound literal for v together with justification.
|
||||
* @return true if a non-trivial upper bound is found, return justifying constraint.
|
||||
*/
|
||||
bool has_upper_bound(pvar v, rational& out_hi, signed_constraint& out_c);
|
||||
bool has_upper_bound(pvar v, rational& out_hi, vector<signed_constraint>& out_c);
|
||||
|
||||
/**
|
||||
* Query for an lower bound literal for v together with justification.
|
||||
* @return true if a non-trivial lower bound is found, return justifying constraint.
|
||||
*/
|
||||
bool has_lower_bound(pvar v, rational& out_lo, signed_constraint& out_c);
|
||||
bool has_lower_bound(pvar v, rational& out_lo, vector<signed_constraint>& out_c);
|
||||
|
||||
/**
|
||||
* Find a next viable value for variable.
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue