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

Copyright(c) Masahiro Sakai 2011-2013
LicenseBSD-style
Maintainermasahiro.sakai@gmail.com
Stabilityprovisional
Portabilityportable
Safe HaskellSafe
LanguageHaskell2010

ToySolver.Data.DNF

Description

Disjunctive Normal Form

Synopsis

Documentation

newtype DNF lit Source #

Disjunctive normal form

Constructors

DNF 

Fields

  • unDNF :: [[lit]]

    list of conjunction of literals

Instances

Show lit => Show (DNF lit) Source # 

Methods

showsPrec :: Int -> DNF lit -> ShowS #

show :: DNF lit -> String #

showList :: [DNF lit] -> ShowS #

Complement lit => Boolean (DNF lit) Source # 

Methods

(.=>.) :: DNF lit -> DNF lit -> DNF lit Source #

(.<=>.) :: DNF lit -> DNF lit -> DNF lit Source #

Complement lit => Complement (DNF lit) Source # 

Methods

notB :: DNF lit -> DNF lit Source #

MonotoneBoolean (DNF lit) Source # 

Methods

true :: DNF lit Source #

false :: DNF lit Source #

(.&&.) :: DNF lit -> DNF lit -> DNF lit Source #

(.||.) :: DNF lit -> DNF lit -> DNF lit Source #

andB :: [DNF lit] -> DNF lit Source #

orB :: [DNF lit] -> DNF lit Source #

Complement lit => IfThenElse (DNF lit) (DNF lit) Source # 

Methods

ite :: DNF lit -> DNF lit -> DNF lit -> DNF lit Source #