Switch to: Citations

References in:

Algorithms and complexity results for persuasive argumentation

Eun Jung Kim, Sebastian Ordyniak & Stefan Szeider

Artificial Intelligence 175 (9-10):1722-1736 (2011)

Add references

You must login to add references.

Bounded treewidth as a key to tractability of knowledge representation and reasoning.Georg Gottlob, Reinhard Pichler & Fang Wei - 2010 - Artificial Intelligence 174 (1):105-132.details Download Export citation Bookmark 4 citations
On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games.Phan Minh Dung - 1995 - Artificial Intelligence 77 (2):321-357.details Download Export citation Bookmark 448 citations
Computational properties of argument systems satisfying graph-theoretic constraints.Paul E. Dunne - 2007 - Artificial Intelligence 171 (10-15):701-729.details Download Export citation Bookmark 29 citations
Audiences in argumentation frameworks.Trevor J. M. Bench-Capon, Sylvie Doutre & Paul E. Dunne - 2007 - Artificial Intelligence 171 (1):42-71.details Download Export citation Bookmark 46 citations
How to reason defeasibly.John L. Pollock - 1992 - Artificial Intelligence 57 (1):1-42.details Download Export citation Bookmark 60 citations
An abstract, argumentation-theoretic approach to default reasoning.A. Bondarenko, P. M. Dung, R. A. Kowalski & F. Toni - 1997 - Artificial Intelligence 93 (1-2):63-101.details Download Export citation Bookmark 103 citations
(2 other versions)Parameterized Complexity Theory.J. Flum - 2007 - Bulletin of Symbolic Logic 13 (2):246-248.details Download Export citation Bookmark 20 citations
Bucket elimination: A unifying framework for reasoning.Rina Dechter - 1999 - Artificial Intelligence 113 (1-2):41-85.details Download Export citation Bookmark 22 citations
Recursive conditioning.Adnan Darwiche - 2001 - Artificial Intelligence 126 (1-2):5-41.details Download Export citation Bookmark 12 citations

1