Complexity in infinite argumentation with structural constraints

DOI10.1093/LOGCOM/EXAG036MaRDI QIDQ7311971zbMATH OpenFDO

Authors Uri Andrews, Luca San Mauro

Publication date 11 August 2026

Published in Journal of Logic and Computation (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1093/LOGCOM/EXAG036

Mathematics Subject Classification ID

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

Cites work

• A comprehensive study of argumentation frameworks with sets of attacking arguments
• Abstract argumentation frameworks with strong and weak constraints
• Automata for infinite argumentation structures
• Coherence in finite argument systems.
• Computational Complexity
• Computational properties of argument systems satisfying graph-theoretic constraints
• Constraints and lifting-based (conditional) preferences in abstract argumentation
• Continuum argumentation frameworks from cooperative game theory
• Credulous acceptance in high-order argumentation frameworks with necessities: an incremental approach
• Explainable acceptance in probabilistic and incomplete abstract argumentation frameworks
• Graph theoretical structures in logic programs and default theories
• Handbook of formal argumentation. Volume 3
• scientific article; zbMATH DE number 722611 (Why is no real title available?)
• scientific article; zbMATH DE number 6934384 (Why is no real title available?)
• Mathematical logic as based on the theory of types.
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
• On the semantics of abstract argumentation frameworks: a logic programming approach
• On topology-related properties of abstract argumentation semantics. A correction and extension to ``Dynamics of argumentation systems: a division-based method
• Paradox without Self-Reference
• Propositional discourse logic
• SCC-recursiveness in infinite argumentation
• Stage semantics and the SCC-recursive schema for argumentation semantics
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• The complexity landscape of claim-augmented argumentation frameworks
• Towards fixed-parameter tractable algorithms for abstract argumentation

This page was built for publication: Complexity in infinite argumentation with structural constraints

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