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

Copyright(c) Masahiro Sakai 2012
LicenseBSD-style
Maintainermasahiro.sakai@gmail.com
Stabilityprovisional
Portabilitynon-portable
Safe HaskellNone
LanguageHaskell2010

ToySolver.SAT.MUS

Description

Minimal Unsatifiable Subset (MUS) Finder

References:

Synopsis

Documentation

data Method Source #

Instances
Bounded Method Source # 
Instance details

Defined in ToySolver.SAT.MUS.Base

Enum Method Source # 
Instance details

Defined in ToySolver.SAT.MUS.Base

Eq Method Source # 
Instance details

Defined in ToySolver.SAT.MUS.Base

Methods

(==) :: Method -> Method -> Bool #

(/=) :: Method -> Method -> Bool #

Ord Method Source # 
Instance details

Defined in ToySolver.SAT.MUS.Base

Show Method Source # 
Instance details

Defined in ToySolver.SAT.MUS.Base

data Options Source #

Options for MUS finding.

The default value can be obtained by def.

Constructors

Options 

Fields

  • optMethod :: Method
     
  • optLogger :: String -> IO ()
     
  • optShowLit :: Lit -> String
     
  • optEvalConstr :: Model -> Lit -> Bool

    Because each soft constraint C_i is represented as a selector literal l_i together with a hard constraint l_i ⇒ C_i, there are cases that a model assigns false to l_i even though C_i itself is true. This function is used to inform the truth value of the original constraint C_i that corresponds to the selector literal l_i.

  • optUpdateBest :: US -> IO ()
     
Instances
Default Options Source # 
Instance details

Defined in ToySolver.SAT.MUS.Base

Methods

def :: Options #

findMUSAssumptions :: Solver -> Options -> IO MUS Source #

Find a minimal set of assumptions that causes a conflict. Initial set of assumptions is taken from getFailedAssumptions.