mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-04-06 01:24:08 +00:00
Code Activity

outline scheme

Browse source 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
Nikolaj Bjorner 2022-12-15 14:57:52 -08:00
parent f01d9d29d2
commit ecf25a4fe2
1 changed files with 18 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

18
src/ast/simplifiers/solve_eqs.cpp
View file

@ -13,6 +13,24 @@ Author:
Nikolaj Bjorner (nbjorner) 2022-11-2.
Notes:
extract_subst is inefficient.
It traverses the same sub-terms many times.
Outline of a presumably better scheme:
1. maintain map FV: term -> bit-set where bitset reprsents set of free variables. Assume the number of variables is bounded.
FV is built from initial terms.
2. maintain parent: term -> term-list of parent occurrences.
3. repeat
pick x = t, such that x not in FV(t)
orient x -> t
for p in parent*(x):
FV(p) := FV(p) u FV(t)
if y = s is processed and x in FV(s) order y < x
if y = s is processed and x in FV(t) order x < y
--*/