• ABEL

  • Referenced in 2 articles [sw02787]
  • ABEL: An interactive tool for probabilistic argumentative reasoning. Most formal approaches to argumentative reasoning under ... exception is the framework of probabilistic argumentation systems. Its philosophy is to include both qualitative ... language that allows to describe probabilistic argumentation systems and corresponding queries about hypotheses. It then...
  • Tweety

  • Referenced in 8 articles [sw22090]
  • classical logics, conditional logics, probabilistic logics, and argumentation. Furthermore, Tweety contains libraries for dealing with...
  • Autoepigraph

  • Referenced in 1 article [sw33594]
  • graphs are a recent proposal for probabilistic argumentation that allows for modelling an agent...
  • BRECCIA

  • Referenced in 1 article [sw31708]
  • this is a novel approach to probabilistic argumentation analysis...
  • CryptHOL

  • Referenced in 7 articles [sw28582]
  • formalising cryptographic arguments in Isabelle/HOL. It shallowly embeds a probabilistic functional programming language in higher...
  • Storm

  • Referenced in 1 article [sw41844]
  • programs. Given a probabilistic program (with associated data and inference arguments) that causes a failure ... smaller version of the program, data, and arguments that cause the same failure. Storm leverages ... transformations from compiler testing and domain-specific, probabilistic transformations. The paper presents new transformations that ... expressions, reduce data size, and simplify inference arguments (e.g., the number of iterations...
  • libiop

  • Referenced in 9 articles [sw31793]
  • tool chain for transforming certain types of probabilistic proofs (see below) into zkSNARKs with ... paradigm: The Ligero protocol from [AHIV], whose argument size is O(N0.5). The Aurora protocol...
  • PITA

  • Referenced in 22 articles [sw06950]
  • given rise to the field of probabilistic logic programming (PLP), leading to languages such ... PRISM, including optimizations that reduce non-discriminating arguments and the computation of Viterbi paths. Furthermore...
  • ClaimEval

  • Referenced in 1 article [sw23918]
  • extracts a set of pro and con arguments from the Web information sources, and jointly ... sources and correctness of claims. ClaimEval uses Probabilistic Soft Logic (PSL), resulting in a flexible...
  • MiniBrass

  • Referenced in 1 article [sw31298]
  • been proposed, such as weighted, fuzzy, or probabilistic constraints. All of them were shown ... semiring from an arbitrary PVS. Both arguments draw upon elements from category theory. MiniBrass turns...
  • Coq

  • Referenced in 1880 articles [sw00161]
  • Coq is a formal proof management system. It...
  • Isabelle

  • Referenced in 698 articles [sw00454]
  • Isabelle is a generic proof assistant. It allows...
  • LEDA

  • Referenced in 263 articles [sw00509]
  • In the core computer science areas -- data structures...
  • Maple

  • Referenced in 5363 articles [sw00545]
  • The result of over 30 years of cutting...
  • Mathematica

  • Referenced in 6337 articles [sw00554]
  • Almost any workflow involves computing results, and that...
  • Matlab

  • Referenced in 13460 articles [sw00558]
  • MATLAB® is a high-level language and interactive...
  • MiniSat

  • Referenced in 565 articles [sw00577]
  • An extensible SAT-solver. MiniSat is a minimalistic...
  • NLTK

  • Referenced in 40 articles [sw00626]
  • This book offers an introduction to Natural Language...
  • R

  • Referenced in 9810 articles [sw00771]
  • R is a language and environment for statistical...