Dependency graph with general (AND/OR) dependencies This is similar to Is there such a thing as an &quot;or&quot; case in a dependency graph?

I am trying to represent a dependency graph where the dependencies for an individual node may be a general boolean function of other nodes.

For example, node A may be reachable from node B or node C.

I can't see how to represent this with a DAG. Is there way to represent general boolean dependencies in a DAG? If there isn't, what other sort of structure should I use?
Sorry for the crappy mspaint, but you could make an intermediate layer where the nodes in the middle represent each of the combinations of (A,B), like in a truth table:



~ABB~