Sciweavers

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

6

AAAI
2006

favoriteEmaildiscussreport

101views Intelligent Agents» more AAAI 2006»

On the Complexity of Linking Deductive and Abstract Argument Systems

13 years 6 months ago

On the Complexity of Linking Deductive and Abstract Argument Systems

Download www.aaai.org

Michael Wooldridge, Paul E. Dunne, Simon Parsons

Real-time Traffic

AAAI 2006 | Intelligent Agents |

claim paper

Related Content

» Generating the Structure of Argument

» Complexity Properties of Restricted Abstract Argument Systems

» Minimal Deductive Systems for RDF

» Computing Preferred Extensions for Argumentation Systems with Sets of Attacking Arguments

» Argumentative alternating offers

» Explaining Synthesized Software

» Inconsistency tolerance in weighted argument systems

» A Logic for Anytime Deduction and Anytime Compilation

» Coherence in finite argument systems

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2006
Where	AAAI
Authors	Michael Wooldridge, Paul E. Dunne, Simon Parsons

Comments (0)