Abstract

We translate the argumentation networks A=(S,R){\cal A}=(S, R) into a theory DD of intuitionistic logic, retaining SS as the domain and using intuitionistic negation to model the attack RR in A{\cal A}: the attack xRyxRy is translated to x→¬yx\to\neg y. The intuitionistic models of DD characterise the complete extensions of A{\cal A}. 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 "xRyxRy" can itself attack another attack "uRvuRv"; one can make higher level meta-statements WW on (S,R)(S, R) and such meta-statements can attack and be attacked in the domain.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.