
ZTree
 Referenced in 558 articles
[sw11707]
 representation, allowing the simple programming of normal form games, extensive form games, double auctions...

MATCONT
 Referenced in 322 articles
[sw00551]
 interactive environment for the continuation and normal form analysis of dynamical systems ... extended systems, and the computation of normal form coefficients for bifurcations of limit cycles...

VAMPIRE
 Referenced in 229 articles
[sw02918]
 system works only with clausal normal forms, the shell accepts a problem in the full...

Walksat
 Referenced in 204 articles
[sw04328]
 have been converted into, conjunctive normal form. They start by assigning a random value...

JBool
 Referenced in 100 articles
[sw06185]
 Boolean Functions defined either by conjonctive normal forms (clausal) or by disjonctive ones. Boolean Functions...

PROC NLMIXED
 Referenced in 55 articles
[sw11039]
 random effects) having either a standard form (normal, binomial, Poisson) or a general distribution that...

Homology
 Referenced in 28 articles
[sw04871]
 simplicial homology based on efficient Smith normal form algorithms Geometric properties of topological spaces ... calculation of the Smith Normal Form of the boundary matrices which, in general, are sparse ... calculation of the Smith Normal Form of sparse matrices and compare their running times...

classifyCeq.lib
 Referenced in 36 articles
[sw11249]
 certain invariants without computing the normal form. We also give a description of the algorithms...

UnitWalk
 Referenced in 34 articles
[sw00993]
 problem for Boolean formulas in conjunctive normal form. Despite its simplicity, this algorithm performs well...

Janet
 Referenced in 33 articles
[sw07776]
 implemented to compute the Jacobson normal form of a matrix with entries in this Weyl...

DepQBF
 Referenced in 30 articles
[sw09734]
 boolean formulae (QBF) in prenex conjunctive normal form. It is based on the DPLL algorithm...

KoMeT
 Referenced in 13 articles
[sw28720]
 value of different definitional translations to normal form. In this paper, we compare different normal ... form translations from a practical point of view. The usual translation of a closed ... firstorder formula to a disjunctive normal form has severe drawbacks, namely the disruption ... increase of the length of the normal form. In implementations, the standard translation is preferred...

Coxeter
 Referenced in 22 articles
[sw07827]
 following : Reduced expression and normal form computations; Bruhat ordering; Ordinary KazhdanLusztig polynomials; KazhdanLusztig...

GAMUT
 Referenced in 14 articles
[sw30178]
 algorithm requiring a normalform game as input. GAMUT is not to be confused with ... analysis of finite extensive and normal form games. GAMUT is made to be used...

PrecoSAT
 Referenced in 18 articles
[sw07832]
 propositional formula in conjunctive normal form (CNF). The Handbook of Satisfiability gives an excellent overview...

Nenofex
 Referenced in 18 articles
[sw09579]
 quantified boolean formulae (QBF) in negation normal form (NNF), which relies on expansion...

FLOTTER
 Referenced in 16 articles
[sw29685]
 FLOTTER and SPASS are a clause normal form translator for firstorder logic...

DDebugger
 Referenced in 15 articles
[sw09904]
 calculus to infer reductions, sort inferences, normal forms, and least sorts with the equational subset...

HARP
 Referenced in 15 articles
[sw26323]
 avoids conversion to any kind of normal form, and combines a proof condensation procedure with...

Autowrite
 Referenced in 8 articles
[sw01282]
 systems (TRSs) every term not in normal form contains a needed redex (i.e., a redex ... needed redexes results in a normal form if it exists. However, neededness is in general...