Talk:Propositional directed acyclic graph

Delete or merge into Boolean Circuit?
The concept of a Propositional directed acyclic graph is the same as a Boolean circuit over the standard {AND, OR, NOT} basis. Boolean circuits are more general and were introduced before the references the article cites were published. A Google Scholar search did not show much adoption for this terminology outside of the research group that coined it. Mvinyals (talk) 17:56, 1 August 2013 (UTC)