CoQuiAAS

CoQuiAAS: a constraint-based quick abstract argumentation solver. This paper is a description of our proposal to use Constraint Programming techniques to develop a software library dedicated to argumentative reasoning. We present a library which offers the advantages to be generic and easily adaptable

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 5 articles )

Showing results 1 to 5 of 5.
Sorted by year (citations)

  1. Baumeister, Dorothea; Järvisalo, Matti; Neugebauer, Daniel; Niskanen, Andreas; Rothe, Jörg: Acceptance in incomplete argumentation frameworks (2021)
  2. Gaggl, Sarah A.; Linsbichler, Thomas; Maratea, Marco; Woltran, Stefan: Design and results of the second international competition on computational models of argumentation (2020)
  3. Kuhlmann, Isabelle; Thimm, Matthias: Using graph convolutional networks for approximate reasoning with abstract argumentation frameworks: a feasibility study (2019)
  4. Cerutti, Federico; Vallati, Mauro; Giacomin, Massimiliano: On the impact of configuration on abstract argumentation automated reasoning (2018)
  5. Thimm, Matthias; Villata, Serena: The first international competition on computational models of argumentation: results and analysis (2017)