toysolver-0.7.0: Assorted decision procedures for SAT, SMT, Max-SAT, PB, MIP, etc
Copyright(c) Masahiro Sakai 2016
LicenseBSD-style
Maintainermasahiro.sakai@gmail.com
Stabilityprovisional
Portabilityportable
Safe HaskellNone
LanguageHaskell2010

ToySolver.Text.QDimacs

Description

Deprecated: Use ToySolver.FileFormat.CNF instead

Synopsis

Documentation

data QDimacs Source #

QDIMACS format

Quantified boolean expression in prenex normal form, consisting of a sequence of quantifiers (qdimacsPrefix) and a quantifier-free CNF part (qdimacsMatrix).

References:

Constructors

QDimacs 

Fields

data Quantifier Source #

Quantifier

Constructors

E

existential quantifier (∃)

A

universal quantifier (∀)

Instances

Instances details
Bounded Quantifier Source # 
Instance details

Defined in ToySolver.FileFormat.CNF

Enum Quantifier Source # 
Instance details

Defined in ToySolver.FileFormat.CNF

Eq Quantifier Source # 
Instance details

Defined in ToySolver.FileFormat.CNF

Ord Quantifier Source # 
Instance details

Defined in ToySolver.FileFormat.CNF

Read Quantifier Source # 
Instance details

Defined in ToySolver.FileFormat.CNF

Show Quantifier Source # 
Instance details

Defined in ToySolver.FileFormat.CNF

type QuantSet = (Quantifier, [Atom]) Source #

Quantified set of variables

type Atom = Var Source #

Synonym of Var

type Lit = Int Source #

Positive (resp. negative) literals are represented as positive (resp. negative) integers. (DIMACS format).

type Clause = [Lit] Source #

Disjunction of Lit.

parseFile :: (FileFormat a, MonadIO m) => FilePath -> m (Either String a) Source #

Parse a file but returns an error message when parsing fails.

parseByteString :: ByteString -> Either String QDimacs Source #

Parse a QDimacs file but returns an error message when parsing fails.

Generating .qdimacs files

writeFile :: (FileFormat a, MonadIO m) => FilePath -> a -> m () Source #

Write a value into a file.

hPutQDimacs :: Handle -> QDimacs -> IO () Source #

Output a QDimacs to a Handle.