dynPARTIX - A Dynamic Programming Reasoner for Abstract Argumentation

08/24/2011
by   Wolfgang Dvorák, et al.
0

The aim of this paper is to announce the release of a novel system for abstract argumentation which is based on decomposition and dynamic programming. We provide first experimental evaluations to show the feasibility of this approach.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/19/2019

Turing-Completeness of Dynamics in Abstract Persuasion Argumentation

Abstract Persuasion Argumentation (APA) is a dynamic argumentation forma...
research
07/23/2015

Improved Answer-Set Programming Encodings for Abstract Argumentation

The design of efficient solutions for abstract argumentation problems is...
research
07/15/2022

Fitting a Multi-modal Density by Dynamic Programming

We consider the problem of fitting a probability density function when i...
research
06/04/2014

Improvement Tracking Dynamic Programming using Replication Function for Continuous Sign Language Recognition

In this paper we used a Replication Function (R. F.)for improvement trac...
research
05/03/2007

Multiresolution Approximation of Polygonal Curves in Linear Complexity

We propose a new algorithm to the problem of polygonal curve approximati...
research
07/15/2014

Abduction and Dialogical Proof in Argumentation and Logic Programming

We develop a model of abduction in abstract argumentation, where changes...
research
12/02/2021

A Practical Dynamic Programming Approach to Datalog Provenance Computation

We establish a translation between a formalism for dynamic programming o...

Please sign up or login with your details

Forgot password? Click here to reset