Copyright | (c) Masahiro Sakai 2012 |
---|---|
License | BSD-style |
Maintainer | masahiro.sakai@gmail.com |
Stability | provisional |
Portability | portable |
Safe Haskell | Safe-Inferred |
Language | Haskell2010 |
ToySolver.SAT.MUS
Description
Minimal Unsatifiable Subset (MUS) Finder
References:
- Ulrich Junker. QuickXplain: Preferred explanations and relaxations for over-constrained problems. In Proc. of AAAI’04, pages 167-172, 2004. http://www.aaai.org/Papers/AAAI/2004/AAAI04-027.pdf
Synopsis
- module ToySolver.SAT.MUS.Types
- data Method
- showMethod :: Method -> String
- parseMethod :: String -> Maybe Method
- data Options = Options {
- optMethod :: Method
- optLogger :: String -> IO ()
- optShowLit :: Lit -> String
- optEvalConstr :: Model -> Lit -> Bool
- optUpdateBest :: US -> IO ()
- findMUSAssumptions :: Solver -> Options -> IO MUS
Documentation
module ToySolver.SAT.MUS.Types
Constructors
Deletion | |
Insertion | |
QuickXplain |
showMethod :: Method -> String Source #
Options for MUS finding.
The default value can be obtained by def
.
Constructors
Options | |
Fields
|
findMUSAssumptions :: Solver -> Options -> IO MUS Source #
Find a minimal set of assumptions that causes a conflict.
Initial set of assumptions is taken from getFailedAssumptions
.