Computation in Extended Argumentation Frameworks
From MaRDI portal
Publication:2999118
DOI10.3233/978-1-60750-606-5-119zbMATH Open1211.68400OpenAlexW2123274687MaRDI QIDQ2999118FDOQ2999118
Paul E. Dunne, Sanjay Modgil, Trevor Bench-Capon
Publication date: 11 May 2011
Full work available at URL: http://cgi.csc.liv.ac.uk/~tbc/publications/ecai2010.pdf
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Logic in artificial intelligence (68T27)
Cited In (7)
- Computing argumentation in logic programming
- Extended explanatory argumentation frameworks
- Extension-based semantics for incomplete argumentation frameworks: properties, complexity and algorithms
- Weighted argument systems: basic definitions, algorithms, and complexity results
- Title not available (Why is that?)
- Reduction-Based Approaches to Implement Modgil’s Extended Argumentation Frameworks
- Computational properties of argument systems satisfying graph-theoretic constraints
This page was built for publication: Computation in Extended Argumentation Frameworks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2999118)
