scientific article; zbMATH DE number 6747923

MaRDI QIDQ5283000zbMATH OpenFDO

Authors Guido Governatori, Simone Scannapieco, Antonino Rotolo, Matteo Cristani, F. Oliveri

Publication date 18 July 2017

Full work available at URL https://arxiv.org/abs/1312.4287, http://ebooks.iospress.nl/volumearticle/36973

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Logic in artificial intelligence (68T27) Other game-theoretic models (91A40)

Recommendations

• Abstract games of argumentation strategy and game-theoretical argument strength
• Strategic argumentation
• scientific article; zbMATH DE number 7599965
• Strong refinements for hard problems in argumentation dynamics
• Algorithms and complexity results for persuasive argumentation
• Reasoning about strategies: on the satisfiability problem
• Expressiveness and complexity results for strategic reasoning

Cited in

(6)

• Revision of defeasible preferences
• Abduction in argumentation frameworks
• scientific article; zbMATH DE number 7599965 (Why is no real title available?)
• Approximating agreements in formal argumentation dialogues
• Revising non-monotonic theories with sufficient and necessary conditions: the case of defeasible logic
• Dynamic superiorities in defeasible logic

This page was built for publication:

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