Search Results for author:
Found 6 papers, 1 papers with code
Instantiations and Computational Aspects of Non-Flat Assumption-based Argumentation
We make use of a semantics-preserving translation between ABA and bipolar argumentation frameworks (BAFs).
An AGM Approach to Revising Preferences
We look at preference change arising out of an interaction between two elements: the first is an initial preference ranking encoding a pre-existing attitude; the second element is new preference information signaling input from an authoritative source, which may come into conflict with the initial preference.
Aspartix-V21
In this solver description we present ASPARTIX-V, in its 2021 edition, which participates in the International Competition on Computational Models of Argumentation (ICCMA) 2021.
Harnessing Incremental Answer Set Solving for Reasoning in Assumption-Based Argumentation
In this work, we harness recent advances in incremental ASP solving for developing effective algorithms for reasoning tasks in the logic programming fragment of ABA that are presumably hard for the second level of the polynomial hierarchy, including skeptical reasoning under preferred semantics as well as preferential reasoning.
Weighted Abstract Dialectical Frameworks: Extended and Revised Report
Abstract Dialectical Frameworks (ADFs) generalize Dung's argumentation frameworks allowing various relationships among arguments to be expressed in a systematic way.
Improved Answer-Set Programming Encodings for Abstract Argumentation
The design of efficient solutions for abstract argumentation problems is a crucial step towards advanced argumentation systems.
