On argumentation logic and propositional logic

DOI10.1007/s11225-017-9736-xzbMath1437.68166OpenAlexW2738542397WikidataQ59605289 ScholiaQ59605289MaRDI QIDQ1743995

Francesca Toni, Antonis C. Kakas, Paolo Mancarella

Publication date: 16 April 2018

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11225-017-9736-x

zbMATH Keywords

propositional logicnatural deductionargumentationreductio ad absurdum

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Logic in computer science (03B70) Classical propositional logic (03B05)

Related Items (3)

Classical logic, argument and dialectic ⋮ On argumentation logic and propositional logic ⋮ Normality, non-contamination and logical depth in classical natural deduction

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Postulates for logic-based argumentation systems
• The computational complexity of ideal semantics
• Perfect validity, entailment and paraconsistency
• A proof-theoretic approach to entailment
• Minimally inconsistent LP
• On argumentation logic and propositional logic
• Untersuchungen über das logische Schliessen. I
• On the computational complexity of assumption-based argumentation for default reasoning.
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• On the semantics of abstract argumentation
• Natural deduction and sequent calculus for intuitionistic relevant logic
• A rational account of classical logic argumentation for real-world agents
• Computing argumentation in logic programming

This page was built for publication: On argumentation logic and propositional logic