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

Copyright(c) Masahiro Sakai 2012-2013
LicenseBSD-style
Maintainermasahiro.sakai@gmail.com
Stabilityprovisional
Portabilitynon-portable (ScopedTypeVariables)
Safe HaskellNone
LanguageHaskell2010

ToySolver.Data.Polynomial.GroebnerBasis

Contents

Description

Synopsis

Options

data Options Source #

Options for Gröbner Basis computation.

The default option can be obtained by def.

Constructors

Options 
Instances
Default Options Source # 
Instance details

Defined in ToySolver.Data.Polynomial.GroebnerBasis

Methods

def :: Options #

data Strategy Source #

Constructors

NormalStrategy 
SugarStrategy

sugar strategy (not implemented yet)

Instances
Bounded Strategy Source # 
Instance details

Defined in ToySolver.Data.Polynomial.GroebnerBasis

Enum Strategy Source # 
Instance details

Defined in ToySolver.Data.Polynomial.GroebnerBasis

Eq Strategy Source # 
Instance details

Defined in ToySolver.Data.Polynomial.GroebnerBasis

Ord Strategy Source # 
Instance details

Defined in ToySolver.Data.Polynomial.GroebnerBasis

Read Strategy Source # 
Instance details

Defined in ToySolver.Data.Polynomial.GroebnerBasis

Show Strategy Source # 
Instance details

Defined in ToySolver.Data.Polynomial.GroebnerBasis

Gröbner basis computation

basis :: forall k v. (Eq k, Fractional k, Ord k, Ord v) => MonomialOrder v -> [Polynomial k v] -> [Polynomial k v] Source #

basis' :: forall k v. (Eq k, Fractional k, Ord k, Ord v) => Options -> MonomialOrder v -> [Polynomial k v] -> [Polynomial k v] Source #

reduceGBasis :: forall k v. (Eq k, Ord k, Fractional k, Ord v) => MonomialOrder v -> [Polynomial k v] -> [Polynomial k v] Source #