7 relations: Binary decision diagram, Boolean function, Boolean satisfiability problem, Data structure, Directed acyclic graph, Negation normal form, Theorem.
Binary decision diagram
In computer science, a binary decision diagram (BDD) or branching program is a data structure that is used to represent a Boolean function.
New!!: Propositional directed acyclic graph and Binary decision diagram · See more »
Boolean function
In mathematics and logic, a (finitary) Boolean function (or switching function) is a function of the form ƒ: Bk → B, where B.
New!!: Propositional directed acyclic graph and Boolean function · See more »
Boolean satisfiability problem
In computer science, the Boolean satisfiability problem (sometimes called propositional satisfiability problem and abbreviated as SATISFIABILITY or SAT) is the problem of determining if there exists an interpretation that satisfies a given Boolean formula.
New!!: Propositional directed acyclic graph and Boolean satisfiability problem · See more »
Data structure
In computer science, a data structure is a data organization and storage format that enables efficient access and modification.
New!!: Propositional directed acyclic graph and Data structure · See more »
Directed acyclic graph
In mathematics and computer science, a directed acyclic graph (DAG), is a finite directed graph with no directed cycles.
New!!: Propositional directed acyclic graph and Directed acyclic graph · See more »
Negation normal form
In mathematical logic, a formula is in negation normal form if the negation operator (\lnot) is only applied to variables and the only other allowed Boolean operators are conjunction (\land) and disjunction (\lor). Negation normal form is not a canonical form: for example, a \land (b\lor \lnot c) and (a \land b) \lor (a \land \lnot c) are equivalent, and are both in negation normal form.
New!!: Propositional directed acyclic graph and Negation normal form · See more »
Theorem
In mathematics, a theorem is a statement that has been proven on the basis of previously established statements, such as other theorems, and generally accepted statements, such as axioms.
New!!: Propositional directed acyclic graph and Theorem · See more »
References
[1] https://en.wikipedia.org/wiki/Propositional_directed_acyclic_graph