Improved Answer-Set Programming Encodings for Abstract Argumentation

07/23/2015
by   Sarah A. Gaggl, et al.
0

The design of efficient solutions for abstract argumentation problems is a crucial step towards advanced argumentation systems. One of the most prominent approaches in the literature is to use Answer-Set Programming (ASP) for this endeavor. In this paper, we present new encodings for three prominent argumentation semantics using the concept of conditional literals in disjunctions as provided by the ASP-system clingo. Our new encodings are not only more succinct than previous versions, but also outperform them on standard benchmarks.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/24/2011

Making Use of Advances in Answer-Set Programming for Abstract Argumentation Systems

Dung's famous abstract argumentation frameworks represent the core forma...
research
12/05/2019

Solving Advanced Argumentation Problems with Answer Set Programming

Powerful formalisms for abstract argumentation have been proposed, among...
research
01/08/2013

Utilizing ASP for Generating and Visualizing Argumentation Frameworks

Within the area of computational models of argumentation, the instantiat...
research
08/24/2011

dynPARTIX - A Dynamic Programming Reasoner for Abstract Argumentation

The aim of this paper is to announce the release of a novel system for a...
research
12/22/2016

Solving Set Optimization Problems by Cardinality Optimization via Weak Constraints with an Application to Argumentation

Optimization - minimization or maximization - in the lattice of subsets ...
research
08/09/2021

Harnessing Incremental Answer Set Solving for Reasoning in Assumption-Based Argumentation

Assumption-based argumentation (ABA) is a central structured argumentati...
research
08/30/2023

ABA Learning via ASP

Recently, ABA Learning has been proposed as a form of symbolic machine l...

Please sign up or login with your details

Forgot password? Click here to reset