toysolver-0.6.0: Assorted decision procedures for SAT, SMT, Max-SAT, PB, MIP, etc

Copyright(c) Masahiro Sakai 2016
LicenseBSD-style
Maintainermasahiro.sakai@gmail.com
Stabilityexperimental
Portabilitynon-portable (FlexibleContexts, FlexibleInstances, MultiParamTypeClasses)
Safe HaskellNone
LanguageHaskell2010

ToySolver.SAT.Store.PB

Description

 

Documentation

data PBStore m Source #

Instances
PrimMonad m => AddPBNL m (PBStore m) Source # 
Instance details

Defined in ToySolver.SAT.Store.PB

PrimMonad m => AddPBLin m (PBStore m) Source # 
Instance details

Defined in ToySolver.SAT.Store.PB

PrimMonad m => AddCardinality m (PBStore m) Source # 
Instance details

Defined in ToySolver.SAT.Store.PB

Methods

addAtLeast :: PBStore m -> [Lit] -> Int -> m () Source #

addAtMost :: PBStore m -> [Lit] -> Int -> m () Source #

addExactly :: PBStore m -> [Lit] -> Int -> m () Source #

PrimMonad m => AddClause m (PBStore m) Source # 
Instance details

Defined in ToySolver.SAT.Store.PB

Methods

addClause :: PBStore m -> Clause -> m () Source #

PrimMonad m => NewVar m (PBStore m) Source # 
Instance details

Defined in ToySolver.SAT.Store.PB

Methods

newVar :: PBStore m -> m Var Source #

newVars :: PBStore m -> Int -> m [Var] Source #

newVars_ :: PBStore m -> Int -> m () Source #