• Z-Tree

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

  • Referenced in 254 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 203 articles [sw02918]
  • system works only with clausal normal forms, the shell accepts a problem in the full...
  • Walksat

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

  • Referenced in 89 articles [sw06185]
  • Boolean Functions defined either by conjonctive normal forms (clausal) or by disjonctive ones. Boolean Functions...
  • PROC NLMIXED

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

  • Referenced in 27 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...
  • UnitWalk

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

  • Referenced in 32 articles [sw11249]
  • certain invariants without computing the normal form. We also give a description of the algorithms...
  • Janet

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

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

  • Referenced in 20 articles [sw07827]
  • following : Reduced expression and normal form computations; Bruhat ordering; Ordinary Kazhdan-Lusztig polynomials; Kazhdan-Lusztig...
  • Nenofex

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

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

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

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

  • Referenced in 13 articles [sw29685]
  • FLOTTER and SPASS are a clause normal form translator for first-order logic...
  • HARP

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

  • Referenced in 7 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 ... first-order 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...
  • 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...