1 (1) Elements/BooleanVars should link back to expressions that use them
4 (2) Need to introduce variables in encoding of functions....
7 (3) Some cases can do variable elimination of introduced variables...
9 (4) Might need to indicate what variables we can query about in
12 (5) Could simplify output of functions... Maybe several outputs have
18 (1) TreeConstruction --- need backwards links...
19 BooleanVar/ElementVar should be able to query all of its uses. Should
22 (2) Naive Encoding Pass --- add an encoding to every Element/Function...
24 (3) Encoder Pass --- implement encodings into constraint objects...
26 (4) Test... Make sure the thing works...
28 Next basic implementation phase:
29 (1) Extend Naive Encoder Pass to test other encodings
30 (2) Build more clever function encodings strategies (e.g., equals, add, etc)...
35 (1) TreeRewriting --- probably should do Equivalent Subexpression
36 Elimination (Don't have the same expression appear twice, instead
37 simply link to it again). Possibly good to do in TreeConstruction...
38 This could be lower priority as it isn't really essential to make
39 things work. Should also probably be switchable on/off...
43 (2) Advanced TreeRewriting --- can rewrite functions/predicates to
44 eliminate unused entries or to eliminate effectively identical
45 outputs... e.g., consider a function f() that can output the values
46 1,3, 5, 7, and its output is only ever compared to 3... We could
47 rewrite the values 1, 5, and 7 to be the same value.
49 (3) Advanced Encoding Strategies
50 a) encoding alignment --- making binary index encodings over
51 different sets work together
53 b) Implement K-Map for function encoding
55 (4) Implement search framework --- probably simulated annealing over a
56 population of strategies... search framework should probably be able
57 to turn on/off nearly any optimization we have...
59 (5) Implement backend translation strategies....do optimizations and
60 implement other simplifcation strategies
62 (6) Convert SATCheck to use Constraint Compiler...not sure about order...
65 (7) Profile system....
67 ---------------------------------------------------------------------
71 (0) Support for saving/loading problem instances...
73 (1) Complete satcheck support
75 (2) Advance tree rewriting... Variable value elimination...
77 (3) Think about undefined semantics...
82 Split graph into connected components
85 * Monotonic increasing index
86 * Matched index (equality)
92 --------------------------------------------------------------------