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

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

ToySolver.QBF

Description

Reference:

Synopsis

Documentation

solveNaive :: Int -> Prefix -> Matrix -> IO (Bool, Maybe LitSet) Source #

Naive Algorithm for a Winning Move

solveCEGAR :: Int -> Prefix -> Matrix -> IO (Bool, Maybe LitSet) Source #

Abstraction-Based Algorithm for a Winning Move

solveCEGARIncremental :: Int -> Prefix -> Matrix -> IO (Bool, Maybe LitSet) Source #

Abstraction-Based Algorithm for a Winning Move