A Tool for Reasoning in Assumption-based Argumentation using Tree-decompositions

Andrei Popescu; Johannes Peter Wallner

A Tool for Reasoning in Assumption-based Argumentation using Tree-decompositions

Institute of Software Technology (7160)

Research output: Other contribution

Abstract

ASTRA is system for reasoning in assumption-based argumentation (ABA) that exploits tree-decompositions. The solver takes an ABA framework as input, and uses dynamic-programming (DP) algorithms for reasoning. This is achieved through the D-FLAT framework, which allows for declaratively specifying DP algorithms in answer set programming (ASP). The DP algorithms operate on a tree decomposition of a given ABA framework.

Original language	English
Type	System description
Number of pages	2
Publication status	Published - 2023

Access to Document

https://hdl.handle.net/10138/565357

Cite this

@misc{5c864b9d150f4b7b93f9594241e73e60,

title = "A Tool for Reasoning in Assumption-based Argumentation using Tree-decompositions",

abstract = "ASTRA is system for reasoning in assumption-based argumentation (ABA) that exploits tree-decompositions. The solver takes an ABA framework as input, and uses dynamic-programming (DP) algorithms for reasoning. This is achieved through the D-FLAT framework, which allows for declaratively specifying DP algorithms in answer set programming (ASP). The DP algorithms operate on a tree decomposition of a given ABA framework.",

author = "Andrei Popescu and Wallner, {Johannes Peter}",

year = "2023",

language = "English",

type = "Other",

}

TY - GEN

T1 - A Tool for Reasoning in Assumption-based Argumentation using Tree-decompositions

AU - Popescu, Andrei

AU - Wallner, Johannes Peter

PY - 2023

Y1 - 2023

N2 - ASTRA is system for reasoning in assumption-based argumentation (ABA) that exploits tree-decompositions. The solver takes an ABA framework as input, and uses dynamic-programming (DP) algorithms for reasoning. This is achieved through the D-FLAT framework, which allows for declaratively specifying DP algorithms in answer set programming (ASP). The DP algorithms operate on a tree decomposition of a given ABA framework.

AB - ASTRA is system for reasoning in assumption-based argumentation (ABA) that exploits tree-decompositions. The solver takes an ABA framework as input, and uses dynamic-programming (DP) algorithms for reasoning. This is achieved through the D-FLAT framework, which allows for declaratively specifying DP algorithms in answer set programming (ASP). The DP algorithms operate on a tree decomposition of a given ABA framework.

UR - https://gitlab.tugraz.at/krr/astra

M3 - Other contribution

ER -

A Tool for Reasoning in Assumption-based Argumentation using Tree-decompositions

Abstract

Access to Document

Other files and links

Fingerprint

FWF - Neue KI - A Novel Computational Workflow for Argumentation in AI

Cite this

A Tool for Reasoning in Assumption-based Argumentation using Tree-decompositions

Abstract

Access to Document

Other files and links

Fingerprint

Projects

FWF - Neue KI - A Novel Computational Workflow for Argumentation in AI

Cite this