Satchmo.Relation.Prop

Documentation

implies :: (Ix a, Ix b, MonadSAT m) => Relation a b -> Relation a b -> m Boolean

symmetric :: (Ix a, MonadSAT m) => Relation a a -> m Boolean

transitive :: (Ix a, MonadSAT m) => Relation a a -> m Boolean

irreflexive :: (Ix a, MonadSAT m) => Relation a a -> m Boolean

reflexive :: (Ix a, MonadSAT m) => Relation a a -> m Boolean

regular :: (Ix a, Ix b, MonadSAT m) => Int -> Relation a b -> m Boolean

regular_in_degree :: (Ix a, Ix b, MonadSAT m) => Int -> Relation a b -> m Boolean

regular_out_degree :: (Ix a, Ix b, MonadSAT m) => Int -> Relation a b -> m Boolean

max_in_degree :: (Ix a, Ix b, MonadSAT m) => Int -> Relation a b -> m Boolean

min_in_degree :: (Ix a, Ix b, MonadSAT m) => Int -> Relation a b -> m Boolean

max_out_degree :: (Ix a, Ix b, MonadSAT m) => Int -> Relation a b -> m Boolean

min_out_degree :: (Ix a, Ix b, MonadSAT m) => Int -> Relation a b -> m Boolean

empty :: (Ix a, Ix b, MonadSAT m) => Relation a b -> m Boolean

complete :: (Ix a, Ix b, MonadSAT m) => Relation a b -> m Boolean

disjoint :: (Ix a, Ix b, MonadSAT m) => Relation a b -> Relation a b -> m Boolean

equals :: (Ix a, Ix b, MonadSAT m) => Relation a b -> Relation a b -> m Boolean

is_function :: (Ix a, Ix b, MonadSAT m) => Relation a b -> m Boolean

relation R is a function iff for each x, there is exactly one y such that R(x,y)

is_partial_function :: (Ix a, Ix b, MonadSAT m) => Relation a b -> m Boolean

relation R is a partial function iff for each x, there is at most one y such that R(x,y)

is_bijection :: (Ix a, Ix b, MonadSAT m) => Relation a b -> m Boolean

is_permutation :: (Ix a, MonadSAT m) => Relation a a -> m Boolean