• foxPSL

  • Referenced in 2 articles [sw13725]
  • with a class system and existential quantifiers, allowing for efficient grounding. Moreover, it implements ... configurable optimizations, like optimized grounding of constraints and lazy inference, that improve grounding and inference...
  • EFSMT

  • Referenced in 1 article [sw19487]
  • exists-forall quantified first-order fragment of propositional combinations over constraints (including nonlinear arithmetic ... solvers for respectively solving universally and existentially quantified problems. This algorithms builds on commonly used ... generalizes them to quantifier reasoning by counterexample-guided constraint strengthening. The EFSMT solver uses Bernstein...
  • INTBIS

  • Referenced in 31 articles [sw00442]
  • Algorithm 681: INTBIS, a portable interval Newton/bisection package...
  • TPTP

  • Referenced in 329 articles [sw04143]
  • The TPTP (Thousands of Problems for Theorem Provers...
  • REDLOG

  • Referenced in 147 articles [sw04250]
  • REDLOG is a package that extends the computer...
  • RealPaver

  • Referenced in 50 articles [sw04401]
  • Algorithm 852 Realpaver: nonlinear constraint solving & rigorous global...
  • gaol

  • Referenced in 11 articles [sw05586]
  • Gaol: NOT Just Another Interval Library project (”gaol...
  • FINDER

  • Referenced in 38 articles [sw06376]
  • Finite domain enumerator. This is a finite domain...
  • SATCHMO

  • Referenced in 84 articles [sw06619]
  • SATCHMO: a theorem prover implemented in Prolog. The...
  • AQCS

  • Referenced in 13 articles [sw08109]
  • Approximate quantified constraint solving (AQCS). AQCS is a...
  • IbexOpt

  • Referenced in 13 articles [sw12331]
  • Exploiting monotonicity in interval constraint propagation. ...