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
Portabilitynon-portable (MultiParamTypeClasses)
Safe HaskellSafe
LanguageHaskell2010

ToySolver.Data.IntVar

Description

 

Synopsis

Documentation

type Var = Int Source #

Variables are represented as non-negative integers

type VarSet = IntSet Source #

Set of variables

type VarMap = IntMap Source #

Map from variables

class Variables a where Source #

collecting free variables

Minimal complete definition

vars

Methods

vars :: a -> VarSet Source #

Instances

type Model r = VarMap r Source #

A Model is a map from variables to values.

class Eval m e v | m e -> v where Source #

Evaluataion of something (e.g. expression or formula) under the model.

Minimal complete definition

eval

Methods

eval :: m -> e -> v Source #

Instances

(Eval m e a, Ord a) => Eval m (OrdRel e) Bool Source # 

Methods

eval :: m -> OrdRel e -> Bool Source #

Eval m a Bool => Eval m (BoolExpr a) Bool Source # 

Methods

eval :: m -> BoolExpr a -> Bool Source #

Eval (Model Integer) Lit Bool Source # 

Methods

eval :: Model Integer -> Lit -> Bool Source #

Eval (Model Rational) Constr Bool Source # 
Fractional r => Eval (Model r) (Expr r) r Source # 

Methods

eval :: Model r -> Expr r -> r Source #

Num r => Eval (Model r) (Expr r) r Source # 

Methods

eval :: Model r -> Expr r -> r Source #