AL^+: extended argumentation logic

DOI10.1093/LOGCOM/EXAF067MaRDI QIDQ6849519zbMATH OpenFDO

Authors A. C. Kakas, P. Mancarella

Publication date 5 March 2026

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

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

zbMATH Keywords

argumentation logicpara consistencyreductio ad absurdum

Mathematics Subject Classification ID

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

Cites work

• A logical account of formal argumentation
• Abductive Logic Programming
• Argumentation in artificial intelligence
• Computing argumentation in logic programming
• On argumentation logic and propositional logic
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
• On the semantics of abstract argumentation
• SCC-recursiveness: a general schema for argumentation semantics
• Shedding new light on the foundations of abstract argumentation: modularization and weak admissibility
• Two approaches to the problems of self-attacking arguments and general odd-length cycles of attack

This page was built for publication: \(\mathrm{AL}^+\): extended argumentation logic

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