DeepAI AI Chat
Log In Sign Up

Credulous and Skeptical Argument Games for Complete Semantics in Conflict Resolution based Argumentation

by   Jozef Frtús, et al.

Argumentation is one of the most popular approaches of defining a non-monotonic formalism and several argumentation based semantics were proposed for defeasible logic programs. Recently, a new approach based on notions of conflict resolutions was proposed, however with declarative semantics only. This paper gives a more procedural counterpart by developing skeptical and credulous argument games for complete semantics and soundness and completeness theorems for both games are provided. After that, distribution of defeasible logic program into several contexts is investigated and both argument games are adapted for multi-context system.


page 1

page 2

page 3

page 4


Well-Founded Argumentation Semantics for Extended Logic Programming

This paper defines an argumentation semantics for extended logic program...

Weakly Complete Semantics Based on Undecidedness Blocking

In this paper we introduce a novel family of semantics called weakly com...

On the Graded Acceptability of Arguments in Abstract and Instantiated Argumentation

The paper develops a formal theory of the degree of justification of arg...

SCF2 – an Argumentation Semantics for Rational Human Judgments on Argument Acceptability: Technical Report

In abstract argumentation theory, many argumentation semantics have been...

Measuring Inconsistency in Argument Graphs

There have been a number of developments in measuring inconsistency in l...

Web-based Argumentation

Assumption-Based Argumentation (ABA) is an argumentation framework that ...

Strategic Argumentation is NP-Complete

In this paper we study the complexity of strategic argumentation for dia...