mirror of
https://github.com/Z3Prover/z3
synced 2025-04-28 19:35:50 +00:00
outline for monomial bound propagation
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
parent
127ef59ce4
commit
bda29ca26a
6 changed files with 148 additions and 0 deletions
|
@ -321,6 +321,13 @@ public:
|
|||
}
|
||||
const rational& get_upper_bound(unsigned j) const;
|
||||
const rational& get_lower_bound(unsigned j) const;
|
||||
bool has_lower_bound(lp::var_index var, lp::constraint_index& ci, lp::mpq& value, bool& is_strict) const {
|
||||
return m_lar_solver.has_lower_bound(var, ci, value, is_strict);
|
||||
}
|
||||
bool has_upper_bound(lp::var_index var, lp::constraint_index& ci, lp::mpq& value, bool& is_strict) const {
|
||||
return m_lar_solver.has_upper_bound(var, ci, value, is_strict);
|
||||
}
|
||||
|
||||
|
||||
bool zero_is_an_inner_point_of_bounds(lpvar j) const;
|
||||
bool var_is_int(lpvar j) const { return m_lar_solver.column_is_int(j); }
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue