default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArgument & Computation, Volume 17
Volume 17, Number 1, 2026
- Ekaterina Sviridova
, Elena Cabrio, Serena Villata:
Mining implicit arguments for reasoning: A survey. 3-27 - Kazunori Yamaguchi, Yoshitatsu Matsuda:
Differential equation based on cost for recursive argumentation graph (DECRAG): Continuous framework for recursive bipolar argumentation with similarity. 28-78 - Henri Savigny, Bruno Yun:
AMELIA: A family of multi-task end-to-end language models for argumentation. 79-103
Volume 17, Number 2, 2026
- Ofer Arieli, Christian Straßer:
Representation considerations for logical argumentation frameworks: Minimality, consistency, compactness, and logical preservation. 107-140 - Liuwen Yu, Xu Li, Leendert van der Torre:
Agent defense in abstract argumentation: Semantics and principle-based analysis. 141-182 - Renan Cordeiro, João F. L. Alcântara:
On the equivalence between bipolar argumentation frameworks and frameworks with sets of attacking arguments (SETAFs). 183-204
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-08-03 00:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
