"The Computational Complexity of Ideal Semantics I: Abstract Argumentation ..."

Paul E. Dunne (2008)

> Home

Details and statistics

DOI: —

access: closed

type: Conference or Workshop Paper

metadata version: 2012-03-14

- view
  - electronic edition @ iospress.nl
- export record
  dblp key:
  - conf/comma/Dunne08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/comma/Dunne08
Paul E. Dunne:
The Computational Complexity of Ideal Semantics I: Abstract Argumentation Frameworks. COMMA 2008: 147-158

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.