Uses of Package
sdd

Packages that use sdd

Package	Description
sdd
sdd.ope
sdd.opt

Classes in sdd used by sdd

Class and Description
Assignment An assignment is a function that associates a Boolean to some variables.
SDD An SDD is defined by a SDD tree and the vtree upon which the SDD tree is defined.
SDDConstant An SDD Constant is an SDD Tree that represents a boolean constant, i.e., either true or false.
SDDFunction An SDD function is a deterministic function that associates a variable to an SDD and that is defined recursively from the structure of the SDD.
SDDMemory An SDD memory is an object that remembers the computed SDDTree, i.e., the results of the and, or, not, exists, forall, and tree-based (e.g., left rotation) operations.
SDDTree An SDD tree is a node of the SDD (but not the conjunction).
SDDTreeConjunction A SDDTreeConjunction, i.e., an SDD Tree Conjunction, aka a decomposition element, is a pair of SDDs defined as a conjunction and that are defined on two different (non overlapping) sets of variables.
SDDTreeDisjunction A SDDTreeDisjunction, i.e., an SDD tree disjunction, aka a decomposition, is a set of disjunction elements, where the primes of the elements form a partition of their respective variables (their pair-wise conjunction logically evaluates to false, their disjunction evaluates to true) and the subs are all different.
SDDVariable An SDD Variable is an SDD Tree which depends only on the value of a variable.
Variable A Variable, i.e., a variable, represents a propositional variable, i.e., a variable which can be assigned to true or false.
Vtree A Vtree, i.e., a vtree, is a binary (sub)tree that supports a SDD.
VtreeLeaf A VtreeLeaf, i.e., a (vtree) leaf, is a tree that contains a single variable.
VtreeNode A VtreeNode, i.e., a vtree node, is a binary node in a vtree.
VtreePath A VtreePath, i.e., a Vtree path, is a sequence of vtrees such that each vtree is a child of the previous vtree.

Classes in sdd used by sdd.ope

Class and Description
SDD An SDD is defined by a SDD tree and the vtree upon which the SDD tree is defined.
SDDMemory An SDD memory is an object that remembers the computed SDDTree, i.e., the results of the and, or, not, exists, forall, and tree-based (e.g., left rotation) operations.
SDDTree An SDD tree is a node of the SDD (but not the conjunction).
SDDTreeDisjunction A SDDTreeDisjunction, i.e., an SDD tree disjunction, aka a decomposition, is a set of disjunction elements, where the primes of the elements form a partition of their respective variables (their pair-wise conjunction logically evaluates to false, their disjunction evaluates to true) and the subs are all different.
Vtree A Vtree, i.e., a vtree, is a binary (sub)tree that supports a SDD.
VtreeNode A VtreeNode, i.e., a vtree node, is a binary node in a vtree.
VtreePath A VtreePath, i.e., a Vtree path, is a sequence of vtrees such that each vtree is a child of the previous vtree.

Classes in sdd used by sdd.opt

Class and Description
SDD An SDD is defined by a SDD tree and the vtree upon which the SDD tree is defined.
SDDTree An SDD tree is a node of the SDD (but not the conjunction).
Vtree A Vtree, i.e., a vtree, is a binary (sub)tree that supports a SDD.