Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

COMMA
2008

favoriteEmaildiscussreport

98views Applied Computing» more COMMA 2008»

The Computational Complexity of Ideal Semantics I: Abstract Argumentation Frameworks

13 years 5 months ago

The Computational Complexity of Ideal Semantics I: Abstract Argumentation Frameworks

Download cgi.csc.liv.ac.uk

Paul E. Dunne

Real-time Traffic

Applied Computing | COMMA 2008 |

claim paper

Related Content

» On the computational complexity of assumptionbased argumentation for default reasoning

» Coherence in finite argument systems

» A visually grounded natural language interface for reference to spatial scenes

» Logicbased automated multiissue bilateral negotiation in peertopeer emarketplaces

» Phrase structure detection in dance

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2008
Where	COMMA
Authors	Paul E. Dunne

Comments (0)