Propositional directed acyclic graph
id:
propositional-directed-acyclic-graph-299-5584951
title:
Propositional directed acyclic graph
text:
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 ⊤ (true), ⊥ (false), or a Boolean variable.
Non-leaves are △ , ▽ and ◊ . △ - and ▽ -nodes have at least one child. ◊ -nodes have exactly one child. Leaves labeled with ⊤ represent the constant Boolean function which always evaluates to 1 (0). A leaf labeled with a Bo
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Propositional_directed_acyclic_graph
date created:
date modified:
2024-04-15T19:17:16Z
main entity:
{"identifier":"Q7250415","url":"https://www.wikidata.org/entity/Q7250415"}
image:
fields total:
13
integrity:
13