The attack as intuitionistic negation

DOI10.1093/JIGPAL/JZW012zbMATH Open1405.03026OpenAlexW2267487863MaRDI QIDQ4644572FDOQ4644572

Authors: Michael Gabbay, Dov Gabbay 

Publication date: 8 January 2019

Published in: Logic Journal of the IGPL (Search for Journal in Brave)

Abstract: We translate the argumentation networks $calA=(S,R)$ into a theory $D$ of intuitionistic logic, retaining $S$ as the domain and using intuitionistic negation to model the attack $R$ in $calA$: the attack $xRy$ is translated to $xoegy$. The intuitionistic models of $D$ characterise the complete extensions of $calA$. The reduction of argumentation networks to intuitionistic logic yields, in addition to a representation theorem, some additional benefits: it allows us to give semantics to higher level attacks, where an attack "$xRy$" can itself attack another attack "$uRv$"; one can make higher level meta-statements $W$ on $(S,R)$ and such meta-statements can attack and be attacked in the domain.

Full work available at URL: https://arxiv.org/abs/1510.00077

Recommendations

• The attack as strong negation. I
• Semantics for higher level attacks in extended argumentation frames. I: Overview
• Logical modes of attack in argumentation networks
• Modal provability foundations for argumentation networks
• A Logic of Abstract Argumentation

zbMATH Keywords

argumentationattackintuitionistic negation

Mathematics Subject Classification ID

Many-valued logic (03B50) Logic in artificial intelligence (68T27) Subsystems of classical logic (including intuitionistic logic) (03B20) Logic in computer science (03B70)

Cited In (3)

• The attack as strong negation. I
• Theory of disjunctive attacks, Part I
• Semantics for higher level attacks in extended argumentation frames. I: Overview

This page was built for publication: The attack as intuitionistic negation

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