OBDD.Data

implementation of reduced ordered binary decision diagrams.

the data type

data OBDD v

assumes total ordering on variables

size :: OBDD v -> Index

for external use

null :: OBDD v -> Bool

does the OBDD not have any models?

satisfiable :: OBDD v -> Bool

does the OBDD have any models?

number_of_models :: Ord v => Set v -> OBDD v -> Integer

Number of satisfying assignments with given set of variables. The set of variables must be given since the current OBDD may not contain all variables that were used to construct it, since some nodes may have been removed because they had identical children.

variables :: Ord v => OBDD v -> Set v

all variables that occur in the nodes

paths :: Ord v => OBDD v -> [Map v Bool]

list of all paths

models :: Ord k => Set k -> OBDD k -> [Map k Bool]

list of all models (a.k.a. minterms)

some_model :: Ord v => OBDD v -> IO (Maybe (Map v Bool))

randomly select one model, if possible

fold :: Ord v => (Bool -> a) -> (v -> a -> a -> a) -> OBDD v -> a

Apply function in each node, bottom-up. return the value in the root node. Will cache intermediate results. You might think that count_models = fold (b -> if b then 1 else 0) (v l r -> l + r) but that's not true because a path might omit variables. Use full_fold to fold over interpolated nodes as well.

foldM :: (Monad m, Ord v) => (Bool -> m a) -> (v -> a -> a -> m a) -> OBDD v -> m a

Run action in each node, bottum-up. return the value in the root node. Will cache intermediate results.

full_fold :: Ord v => Set v -> (Bool -> a) -> (v -> a -> a -> a) -> OBDD v -> a

Apply function in each node, bottom-up. Also apply to interpolated nodes: when a link from a node to a child skips some variables: for each skipped variable, we run the branch function on an interpolated node that contains this missing variable, and identical children. With this function, number_of_models can be implemented as full_fold vars (bool 0 1) ( const (+) ). And it actually is, see the source.

full_foldM :: (Monad m, Ord v) => Set v -> (Bool -> m a) -> (v -> a -> a -> m a) -> OBDD v -> m a

for internal use

data Node v i

Constructors

Leaf !Bool

Branch !v !i !i

Instances

(Eq i, Eq v) => Eq (Node v i)

Methods

(==) :: Node v i -> Node v i -> Bool

(/=) :: Node v i -> Node v i -> Bool

(Ord i, Ord v) => Ord (Node v i)

Methods

compare :: Node v i -> Node v i -> Ordering

(<) :: Node v i -> Node v i -> Bool

(<=) :: Node v i -> Node v i -> Bool

(>) :: Node v i -> Node v i -> Bool

(>=) :: Node v i -> Node v i -> Bool

max :: Node v i -> Node v i -> Node v i

min :: Node v i -> Node v i -> Node v i

make :: State (OBDD v) Index -> OBDD v

register :: Ord v => Node v Index -> State (OBDD v) Index

checked_register :: Ord v => Node v Index -> State (OBDD v) Index

cached :: Ord v => (Index, Index) -> State (OBDD v) Index -> State (OBDD v) Index

top :: OBDD v -> Index

access :: OBDD v -> Node v (OBDD v)