• OEIS

  • Referenced in 2773 articles [sw07248]
  • someone has discovered this algorithm before? You decide to ask the OEIS if this sequence ... explicit formula for the nth term. You decide not to apply for a patent...
  • ALGOL 60

  • Referenced in 422 articles [sw21807]
  • generation ALGOL but the ALGOL 68 committee decided on a design that was more complex...
  • Yices

  • Referenced in 95 articles [sw04436]
  • Yices is an efficient SMT solver that decides the satisfiability of arbitrary formulas containing uninterpreted...
  • Modelica

  • Referenced in 70 articles [sw04352]
  • Modelica tool will have enough information to decide that automatically. Modelica is designed such that...
  • RAGlib

  • Referenced in 58 articles [sw00774]
  • over the reals. Provided functionalities allow to decide the existence of real solutions...
  • RcppArmadillo

  • Referenced in 53 articles [sw09313]
  • library is useful if C++ has been decided as the language of choice...
  • QUBE

  • Referenced in 27 articles [sw11381]
  • QuBE: A System for Deciding Quantified Boolean Formulas Satisfiability. Deciding the satisfiability of a Quantified ... directly mapped into the problem of deciding the satisfiability of a QBF. In this paper ... present QuBE, a system for deciding QBFs satisfiability. We start our presentation in § 2 with...
  • MML

  • Referenced in 46 articles [sw06970]
  • many years of loose deliberations, the community decided to investigate the issue of licensing...
  • CVC

  • Referenced in 45 articles [sw09462]
  • cooperating validity checker. Decision procedures for decidable logics and logical theories have proven...
  • KL-ONE

  • Referenced in 38 articles [sw28891]
  • great variety of description logics can be decided using tableau-like algorithms. This...
  • UPPAAL TIGA

  • Referenced in 37 articles [sw12913]
  • long have been known to be decidable there has until now been a lack...
  • CoLoR

  • Referenced in 36 articles [sw09806]
  • been developed to address the problem of deciding termination for specific problems (since...
  • YAGO

  • Referenced in 35 articles [sw11909]
  • logically clean model, which is decidable, extensible, and compatible with RDFS. Finally, we show...
  • LANGAGE

  • Referenced in 34 articles [sw00501]
  • LANGAGE is a set of procedures for deciding whether or not a language given...
  • PANDA

  • Referenced in 33 articles [sw01122]
  • mode. In the second module the user decides which of the design parameters...
  • ASF+SDF

  • Referenced in 30 articles [sw11316]
  • more characteristics of a legacy system, we decided to build a completely new, component-based...
  • JUnit

  • Referenced in 28 articles [sw07262]
  • specification language’s runtime assertion checker to decide whether methods are working correctly, thus automating...
  • LSODA

  • Referenced in 28 articles [sw27217]
  • dynamically monitors data in order to decide which method to use. The LSODA source...
  • Boolector

  • Referenced in 25 articles [sw00085]
  • Modulo Theories (SMT) is the problem of deciding satisfiability of a logical formula, expressed...
  • Algorithm 922

  • Referenced in 25 articles [sw12858]
  • computation efficient, the search interval is decided using a Faber-Krahn type inequality for transmission...