Control.CP.Solver

Documentation

class Monad solver => Solver solver where

Minimal complete definition

add, run, mark, goto

Associated Types

type Constraint solver :: *

the constraints

type Label solver :: *

the labels

Methods

add :: Constraint solver -> solver Bool

add a constraint to the current state, and return whether the resulting state is consistent

run :: solver a -> a

run a computation

mark :: solver (Label solver)

mark the current state, and return its label

markn :: Int -> solver (Label solver)

mark the current state as discontinued, yet return a label that is usable n times

goto :: Label solver -> solver ()

go to the state with given label

Instances

Solver OvertonFD

Associated Types

type Constraint (OvertonFD :: * -> *) :: *

type Label (OvertonFD :: * -> *) :: *

Methods

add :: Constraint OvertonFD -> OvertonFD Bool

run :: OvertonFD a -> a

mark :: OvertonFD (Label OvertonFD)

markn :: Int -> OvertonFD (Label OvertonFD)

goto :: Label OvertonFD -> OvertonFD ()

FDSolver s => Solver (FDInstance s)

Associated Types

type Constraint (FDInstance s :: * -> *) :: *

type Label (FDInstance s :: * -> *) :: *

Methods

add :: Constraint (FDInstance s) -> FDInstance s Bool

run :: FDInstance s a -> a

mark :: FDInstance s (Label (FDInstance s))

markn :: Int -> FDInstance s (Label (FDInstance s))

goto :: Label (FDInstance s) -> FDInstance s ()

(Monoid w, Solver s) => Solver (WriterT w s)

WriterT decoration of a solver useful for producing statistics during solving

Associated Types

type Constraint (WriterT w s :: * -> *) :: *

type Label (WriterT w s :: * -> *) :: *

Methods

add :: Constraint (WriterT w s) -> WriterT w s Bool

run :: WriterT w s a -> a

mark :: WriterT w s (Label (WriterT w s))

markn :: Int -> WriterT w s (Label (WriterT w s))

goto :: Label (WriterT w s) -> WriterT w s ()

add :: Solver solver => Constraint solver -> solver Bool

add a constraint to the current state, and return whether the resulting state is consistent

run :: Solver solver => solver a -> a

run a computation

mark :: Solver solver => solver (Label solver)

mark the current state, and return its label

markn :: Solver solver => Int -> solver (Label solver)

mark the current state as discontinued, yet return a label that is usable n times

goto :: Solver solver => Label solver -> solver ()

go to the state with given label

class Solver solver => Term solver term where

Minimal complete definition

newvar, help

Associated Types

type Help solver term

Methods

newvar :: solver term

produce a fresh constraint variable

help :: solver () -> term -> Help solver term

Instances

Term OvertonFD FDVar

Associated Types

type Help (OvertonFD :: * -> *) FDVar :: *

Methods

newvar :: OvertonFD FDVar

help :: OvertonFD () -> FDVar -> Help OvertonFD FDVar

FDSolver s => Term (FDInstance s) ModelCol

Associated Types

type Help (FDInstance s :: * -> *) ModelCol :: *

Methods

newvar :: FDInstance s ModelCol

help :: FDInstance s () -> ModelCol -> Help (FDInstance s) ModelCol

FDSolver s => Term (FDInstance s) ModelBool

Associated Types

type Help (FDInstance s :: * -> *) ModelBool :: *

Methods

newvar :: FDInstance s ModelBool

help :: FDInstance s () -> ModelBool -> Help (FDInstance s) ModelBool

FDSolver s => Term (FDInstance s) ModelInt

Associated Types

type Help (FDInstance s :: * -> *) ModelInt :: *

Methods

newvar :: FDInstance s ModelInt

help :: FDInstance s () -> ModelInt -> Help (FDInstance s) ModelInt

(Monoid w, Term s t) => Term (WriterT w s) t

Associated Types

type Help (WriterT w s :: * -> *) t :: *

Methods

newvar :: WriterT w s t

help :: WriterT w s () -> t -> Help (WriterT w s) t

newvar :: Term solver term => solver term

produce a fresh constraint variable

help :: Term solver term => solver () -> term -> Help solver term