You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
After some research I noticed that algebraic decision diagrams are defined to have binary choices as inner nodes. This means that our definition of 2ADT should be renamed to ADT. In the paper, I currently use Arbitrary algebraic decision tree as a name for NADT to be somewhat consistent with the names for choices. NADT collides with NCC in the sense that N means different things in their names.
The text was updated successfully, but these errors were encountered:
Fixed in PR #28.
We stick with NADT for now though but it is still a bit inconsistent with choice calculus because NADT is not fixed to a particular n as NCC is.
After some research I noticed that algebraic decision diagrams are defined to have binary choices as inner nodes. This means that our definition of
2ADT
should be renamed toADT
. In the paper, I currently useArbitrary algebraic decision tree
as a name forNADT
to be somewhat consistent with the names for choices.NADT
collides withNCC
in the sense thatN
means different things in their names.The text was updated successfully, but these errors were encountered: