mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2026-02-22 08:17:37 +00:00
Code Activity

add sketch for incremental algorithm

Browse source 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
Nikolaj Bjorner 2025-10-30 02:53:13 -07:00
parent 69b73c64cf
commit 07d8971ef9
2 changed files with 3 additions and 1 deletions
Download patch file Download diff file Expand all files Collapse all files

2
src/smt/smt_arith_value.h
View file

@ -50,5 +50,7 @@ namespace smt {
lbool check_lp_feasible(vector<std::pair<bool, expr_ref>> &ineqs, literal_vector &lit_core,
enode_pair_vector &eq_core);
final_check_status final_check(unsigned );
lbool check_lp_feasible(vector<std::pair<bool, expr_ref>> &ineqs, literal_vector &lit_core,
enode_pair_vector &eq_core);
};
};

2
src/smt/theory_finite_set_size.cpp
View file

@ -302,7 +302,7 @@ namespace smt {
* Enumerate all satisfying assignments to m_solver for atoms based on |s|
* Extract Core from enumeration
* Assert Core => |s_i| = sum_ij n_ij for each |s_i| cardinality expression
* NB. Soundness of using Core has not been rigorously established.
* NB. Soundness of using Core has not been rigorously established.
* 2. We can check with theory_lra if slack_sums constraints are linear
* feasible. If they are we can possibly terminate by extracting a model
* If they are infeasible, temporarily strengthen m_solver using the negation of unsat core