Computation in extended argumentation frameworks

DOI10.3233/978-1-60750-606-5-119MaRDI QIDQ2999118zbMATH OpenOpenAlexFDO

Authors Sanjay Modgil, Paul E. Dunne, Trevor Bench-Capon

Publication date 11 May 2011

Full work available at URL http://cgi.csc.liv.ac.uk/~tbc/publications/ecai2010.pdf

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Logic in artificial intelligence (68T27)

Recommendations

• Reduction-based approaches to implement Modgil's extended argumentation frameworks
• Epistemic argumentation framework: theory and computation
• scientific article; zbMATH DE number 1769206
• On the computation of Top-k extensions in abstract argumentation frameworks
• Algorithms for decision problems in argument systems under preferred semantics

Cited in

(13)

• Computational properties of argument systems satisfying graph-theoretic constraints
• Extended explanatory argumentation frameworks
• Automata for infinite argumentation structures
• The matrix approach for abstract argumentation frameworks
• On the computation of Top-k extensions in abstract argumentation frameworks
• Computing argumentation in logic programming
• Modeling time and valuation in structured argumentation frameworks
• Epistemic argumentation framework: theory and computation
• Reduction-based approaches to implement Modgil's extended argumentation frameworks
• scientific article; zbMATH DE number 6747868 (Why is no real title available?)
• Weighted argument systems: basic definitions, algorithms, and complexity results
• Extension-based semantics for incomplete argumentation frameworks: properties, complexity and algorithms
• Static and dynamic orderings on Dungean argumentation frameworks -- an overview

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)