• Tyrolean

  • Referenced in 91 articles [sw07830]
  • termination techniques include: approximated dependency graph, argument filtering, bounds, dependency pair method, Knuth-Bendix order...
  • GRAPPA

  • Referenced in 8 articles [sw20931]
  • GRAPPA: a semantical framework for graph-based argument processing. Graphical models are widely used ... assigning a precise meaning to labelled argument graphs which makes them suitable for automatic evaluation ... define various Dung style semantics for argument graphs. We also introduce a pattern language ... acceptance functions. Moreover, we show how argument graphs can be compiled to ADFs, thus providing...
  • CUTE

  • Referenced in 66 articles [sw00177]
  • pointer arguments, in which case the inputs to the unit are memory graphs. The paper...
  • Autoepigraph

  • Referenced in 1 article [sw33594]
  • model-based theorem prover for epistemic graphs for argumentation. Epistemic graphs are a recent proposal...
  • ProGraph

  • Referenced in 1 article [sw22095]
  • ProGraph: towards enacting bipartite graphs for abstract argumentation frameworks. ProGraph was developed in Prolog ... relies on bipartite graphs to partition the set of arguments in two classes...
  • CalcPad Pro

  • Referenced in 0 articles [sw22797]
  • physical units, variables, functions of multiple arguments, graphing, numerical methods, sums, products, iterations and conditions...
  • ArgQL

  • Referenced in 1 article [sw42616]
  • principles of argumentation. Its syntax is based on Cypher (language for graph databases) and SPARQL ... querying dialogues, composed by sets of arguments and their interrelations. We use formal semantics...
  • Girth-Chromatic

  • Referenced in 1 article [sw29248]
  • theory of Random Graphs to prove the existence with probabilistic arguments...
  • sage-drg

  • Referenced in 5 articles [sw26413]
  • show that there is no distance-regular graph with intersection array ... triple intersection numbers are determined. Further combinatorial arguments are then used to derive nonexistence...
  • dynPARTIX

  • Referenced in 1 article [sw30435]
  • Tool. dynPARTIX is a system for abstract argumentation which is based on decomposition and dynamic ... from [1]. It makes use of the graph-parameter tree-width, which measures the ”tree...
  • nhstplot

  • Referenced in 0 articles [sw16692]
  • arguments (observed test statistic, degrees of freedom) are necessary for a clear and useful graph...
  • PGPLOT

  • Referenced in 2 articles [sw15568]
  • independent graphics package for making simple scientific graphs. It is intended for making graphical images ... library handles conversion between C and Fortran argument-passing conventions. PGPLOT has been tested with...
  • adapr

  • Referenced in 0 articles [sw18766]
  • that are organized into a directed acyclic graph. Contains an interactive shiny application adaprApp(). Uses ... function map in vignette. Makes project specification argument last in order...
  • cdd

  • Referenced in 119 articles [sw00114]
  • The program cdd+ (cdd, respectively) is a C...
  • Coq

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

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

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

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

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

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