ASPARTIX
From MaRDI portal
Cited in
(36)- DialoGPT
- AFRA
- The first international competition on computational models of argumentation: results and analysis
- On the impact of configuration on abstract argumentation automated reasoning
- D-FLAT
- Argumentation frameworks as constraint satisfaction problems
- A distributed argumentation algorithm for mining consistent opinions in weighted Twitter discussions
- Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence
- Probabilistic qualification of attack in abstract argumentation
- A probabilistic approach to modelling uncertain logical arguments
- Weighted argumentation for analysis of discussions in Twitter
- A QBF-based formalization of abstract argumentation semantics
- Solving weighted argumentation frameworks with soft constraints
- Partial semantics of argumentation
- A schema for generating relevant logic programming semantics and its applications in argumentation theory
- RP-DeLP
- ConArg2
- CEGARTIX
- Carneades
- prefMaxSAT
- Dungine
- Argtools
- LamatzSolver
- CoQuiAAS
- ProGraph
- Toward incremental computation of argumentation semantics: a decomposition-based approach
- OSCAR
- dynPARTIX
- EDITS
- pyglaf
- Algorithms for decision problems in argument systems under preferred semantics
- Partial semantics of argumentation: basic properties and empirical
- ELIZA
- Arg2P
- AFRA: argumentation framework with recursive attacks
- On efficiently estimating the probability of extensions in abstract argumentation frameworks
This page was built for software: ASPARTIX
