e/Propositional directed acyclic graph

Information
has gloss	eng: A propositional directed acyclic graph (PDAG) is a data structure that is used to represent a Boolean function. A Boolean function can be represented as a rooted, directed acyclic graph of the following form: * Leaves are labeled with \top (true), \bot (false), or a Boolean variable. * Non-leaves are \mathcal4} (logical and), \mathcal5} (logical or) and \Diamond (logical not). * \mathcal4}- and \mathcal5}-nodes have at least one child. * \Diamond-nodes have exactly one child.
lexicalization	eng: Propositional directed acyclic graph
instance of	c/Graph data structures