| Copyright | (c) Masahiro Sakai 2016 |
|---|---|
| License | BSD-style |
| Maintainer | masahiro.sakai@gmail.com |
| Stability | provisional |
| Portability | non-portable (BangPatterns, ScopedTypeVariables, FlexibleInstances, MultiParamTypeClasses) |
| Safe Haskell | None |
| Language | Haskell2010 |
ToySolver.SAT.Encoder.PB
Description
References:
- [ES06] N. Eén and N. Sörensson. Translating Pseudo-Boolean Constraints into SAT. JSAT 2:1–26, 2006.
Documentation
Instances
| PrimMonad m => AddPBLin m (Encoder m) Source # | |
Defined in ToySolver.SAT.Encoder.PB Methods addPBAtLeast :: Encoder m -> PBLinSum -> Integer -> m () Source # addPBAtMost :: Encoder m -> PBLinSum -> Integer -> m () Source # addPBExactly :: Encoder m -> PBLinSum -> Integer -> m () Source # addPBAtLeastSoft :: Encoder m -> Lit -> PBLinSum -> Integer -> m () Source # addPBAtMostSoft :: Encoder m -> Lit -> PBLinSum -> Integer -> m () Source # addPBExactlySoft :: Encoder m -> Lit -> PBLinSum -> Integer -> m () Source # | |
| PrimMonad m => AddCardinality m (Encoder m) Source # | |
| Monad m => AddClause m (Encoder m) Source # | |
| Monad m => NewVar m (Encoder m) Source # | |
Instances
| Bounded Strategy Source # | |
| Enum Strategy Source # | |
Defined in ToySolver.SAT.Encoder.PB | |
| Eq Strategy Source # | |
| Ord Strategy Source # | |
Defined in ToySolver.SAT.Encoder.PB | |
| Show Strategy Source # | |
| Default Strategy Source # | |
Defined in ToySolver.SAT.Encoder.PB | |
encodePBLinAtLeast :: forall m. PrimMonad m => Encoder m -> PBLinAtLeast -> m Lit Source #