Preprocessing argumentation frameworks via replacement patterns

DOI10.1007/978-3-030-19570-0_8MaRDI QIDQ2296701zbMATH OpenOpenAlexFDO

Authors Wolfgang Dvořák, Matti Järvisalo, Thomas Linsbichler, Andreas Niskanen, Stefan Woltran

Publication date 18 February 2020

Full work available at URL http://hdl.handle.net/10138/309139

zbMATH Keywords

preprocessingabstract argumentationextension enumeration

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Recommendations

• Abstract solvers for Dung's argumentation frameworks
• Complexity-sensitive decision procedures for abstract argumentation
• A general notion of equivalence for abstract argumentation
• Representing argumentation frameworks in answer set programming
• A normal form for argumentation frameworks

Cited in

(3)

• A general notion of equivalence for abstract argumentation
• Acceptance in incomplete argumentation frameworks
• Shedding new light on the foundations of abstract argumentation: modularization and weak admissibility

This page was built for publication: Preprocessing argumentation frameworks via replacement patterns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2296701)