Wondering if there is anything closely resembling data-binding but for boolean values / triggers. It seems like it could be related to Binary Decision Diagrams (BDDs), but they are precomputed rather than dynamic I think.
Say you have 100 or 1000 boolean variables all inter-related in a graph. And one of them changes. The simplest thing is to then just recompute all 1000 values. But it might be more optimal to instead follow the trail from the changed node to the things depending on it. But then again it might lead to a long chase where you have to prevent against re-updating the same boolean more than once, so you could end up with more than 1000 operations.
Wondering if there is anything done on this topic. How to optimally update boolean values that depend on each other in a complex graph.