OBDD.Cube

Documentation

type Cube v = Map v Bool

primes :: Ord v => OBDD v -> [Cube v]

nice :: Show v => Cube v -> String

data Check

Constructors

Sign

Occurs

Original

Instances

Eq Check

Methods

(==) :: Check -> Check -> Bool

(/=) :: Check -> Check -> Bool

Ord Check

Methods

compare :: Check -> Check -> Ordering

(<) :: Check -> Check -> Bool

(<=) :: Check -> Check -> Bool

(>) :: Check -> Check -> Bool

(>=) :: Check -> Check -> Bool

max :: Check -> Check -> Check

min :: Check -> Check -> Check

Show Check

Methods

showsPrec :: Int -> Check -> ShowS

show :: Check -> String

showList :: [Check] -> ShowS

sign :: Ord a => a -> OBDD (a, Check)

occurs :: Ord a => a -> OBDD (a, Check)

original :: Ord a => a -> OBDD (a, Check)

process :: Ord k => Map (k, Check) Bool -> Map k Bool

prime :: Ord v => OBDD v -> OBDD (v, Check)

O. Coudert , J. C. Madre: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.3330

naive way of finding a minimal set of clauses.

dnf :: Ord k => OBDD k -> [Cube k]

cnf :: Ord k => OBDD k -> [Map k Bool]

greed :: (Ord a, Ord b) => Map a b -> [Set a] -> Set a

clause :: Ord v => Map v Bool -> OBDD v