toysolver-0.0.5: Assorted decision procedures for SAT, Max-SAT, PB, MIP, etc (Index - N)

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

A
B
C
D
E
F
G
H
I
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
:
.
All

Index - N

narrow	Data.Polynomial.RootSeparation.Sturm
narrow'	Data.Polynomial.RootSeparation.Sturm
nAssigns	SAT
nBlock	Text.SDPFile
nClauses	SAT
Neg
1 (Data Constructor)	Algorithm.FOLModelFinder
2 (Data Constructor)	Data.Sign, Algorithm.CAD
negatePBAtLeast	SAT.Types
NegInf
1 (Data Constructor)	Text.LPFile
2 (Data Constructor)	Algorithm.CAD
negOp	Data.ArithRel, Data.FOL.Arith
NEq	Data.ArithRel, Algorithm.Simplex2, Data.FOL.Arith
newEncoder	SAT.TseitinEncoder
newSolver
1 (Function)	SAT
2 (Function)	Algorithm.CongruenceClosure
3 (Function)	Algorithm.Simplex2
4 (Function)	Algorithm.MIPSolver2
newVar
1 (Function)	SAT
2 (Function)	Algorithm.CongruenceClosure
3 (Function)	Algorithm.Simplex2
4 (Function)	SAT.Integer
newVars	SAT
newVars_	SAT
nLearnt	SAT
Nonneg	Algorithm.FourierMotzkin.Core, Algorithm.FourierMotzkin
NormalConstraint	Text.LPFile
normalizeAtLeast	SAT.Types
normalizeClause	SAT.Types
normalizeConstraint	Algorithm.LPSolver
normalizePBAtLeast	SAT.Types
normalizePBExactly	SAT.Types
normalizePBSum	SAT.Types
normalizePoly	Data.AlgebraicNumber.Root
NormalStrategy	Data.Polynomial.GBasis
Not
1 (Data Constructor)	SAT.TseitinEncoder
2 (Data Constructor)	Algorithm.FOLModelFinder
3 (Data Constructor)	Data.FOL.Formula, Data.FOL.Arith
notB	Algebra.Lattice.Boolean, Data.FOL.Formula, Data.FOL.Arith
NthRoot
1 (Type/Class)	Data.Polynomial.RootSeparation.Graeffe
2 (Data Constructor)	Data.Polynomial.RootSeparation.Graeffe
nthRoot	Data.AlgebraicNumber.Real
numClauses
1 (Function)	Text.GCNF
2 (Function)	Text.MaxSAT
numRoots	Data.Polynomial.RootSeparation.Sturm
numRoots'	Data.Polynomial.RootSeparation.Sturm
numVars
1 (Function)	Text.GCNF
2 (Function)	Text.MaxSAT
nVars
1 (Function)	SAT
2 (Function)	Algorithm.Simplex2