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
Stabilityexperimental
Portabilitynon-portable (FlexibleContexts, MultiParamTypeClasses)
Safe HaskellNone
LanguageHaskell2010

ToySolver.Converter.PB2SAT

Description

 

Synopsis

Documentation

convert :: Formula -> (CNF, Model -> Model, Model -> Model) Source #

Convert a pseudo boolean formula φ to a equisatisfiable CNF formula ψ together with two functions f and g such that:

  • if M ⊨ φ then f(M) ⊨ ψ
  • if M ⊨ ψ then g(M) ⊨ φ