


default search action
TAFA 2013: Beijing, China
- Elizabeth Black, Sanjay Modgil, Nir Oren:
Theory and Applications of Formal Argumentation - Second International Workshop, TAFA 2013, Beijing, China, August 3-5, 2013, Revised Selected papers. Lecture Notes in Computer Science 8306, Springer 2014, ISBN 978-3-642-54372-2 - Sanjay Modgil
:
Revisiting Abstract Argumentation Frameworks. 1-15 - Sinan Egilmez
, João G. Martins, João Leite
:
Extending Social Abstract Argumentation with Votes on Attacks. 16-31 - Cosmina Croitoru, Timo Kötzing:
A Normal Form for Argumentation Frameworks. 32-45 - Robert Craven, Francesca Toni, Matthew Williams
:
Graph-Based Dispute Derivations in Assumption-Based Argumentation. 46-62 - Nir Oren
:
Argument Schemes for Normative Practical Reasoning. 63-78 - Yang Gao, Francesca Toni:
Argumentation Accelerated Reinforcement Learning for RoboCup Keepaway-Takeaway. 79-94 - Elizabeth Black
, Peter McBurney
, Steffen Zschaler
:
Towards Agent Dialogue as a Tool for Capturing Software Design Discussions. 95-110 - Ringo Baumann, Hannes Strass:
On the Maximal and Average Numbers of Stable Extensions. 111-126 - Xiuyi Fan, Francesca Toni
:
Decision Making with Assumption-Based Argumentation. 127-142 - Hiroyuki Kido, Yukio Ohsawa:
Justifying Underlying Desires for Argument-Based Reconciliation. 143-157 - Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider
:
The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation. 158-175 - Federico Cerutti
, Paul E. Dunne
, Massimiliano Giacomin
, Mauro Vallati
:
Computing Preferred Extensions in Abstract Argumentation: A SAT-Based Approach. 176-193 - Beishui Liao, Liyun Lei, Jianhua Dai:
Computing Preferred Labellings by Exploiting SCCs and Most Sceptically Rejected Arguments. 194-208

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.