Guaranteeing Admissibility of Abstract Argumentation Frameworks with Rationality and Feasibility Constraints

DOI10.1093/LOGCOM/EXAB011MaRDI QIDQ5019290zbMATH OpenOpenAlexFDO

Authors Weiwei Chen

Publication date 3 January 2022

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/logcom/exab011

zbMATH Keywords

admissibilityargumentation theoryjudgment aggregationvalue restriction

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Recommendations

• On checking skeptical and ideal admissibility in abstract argumentation frameworks
• Rationalisation of profiles of abstract argumentation frameworks: characterisation and complexity
• Revisiting Abstract Argumentation Frameworks
• A logic of argumentation for specification and verification of abstract argumentation frameworks
• Logical limits of abstract argumentation frameworks
• On the semantics of abstract argumentation frameworks: a logic programming approach
• New weak admissibility semantics for abstract argumentation
• From structured to abstract argumentation: assumption-based acceptance via AF reasoning
• Towards fixed-parameter tractable algorithms for abstract argumentation

Cited in

(2)

• Shedding new light on the foundations of abstract argumentation: modularization and weak admissibility
• Collective argumentation with topological restrictions

This page was built for publication: Guaranteeing Admissibility of Abstract Argumentation Frameworks with Rationality and Feasibility Constraints

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