From Structured to Abstract Argumentation: Assumption-Based Acceptance via AF Reasoning

@inproceedings{Lehtonen2017FromST,
  title={From Structured to Abstract Argumentation: Assumption-Based Acceptance via AF Reasoning},
  author={Tuomo Lehtonen and Johannes Peter Wallner and Matti J{\"a}rvisalo},
  booktitle={ECSQARU},
  year={2017}
}
We study the applicability of abstract argumentation (AF) reasoners in efficiently answering acceptability queries over assumption-based argumentation (ABA) frameworks, one of the prevalent forms of structured argumentation. We provide a refined algorithm for translating ABA frameworks to AFs allowing the use of AF reasoning to answer ABA acceptability queries, covering credulous and skeptical acceptance problems over ABAs in a seamless way under several argumentation semantics. We empirically… 
Reasoning over Assumption-Based Argumentation Frameworks via Direct Answer Set Programming Encodings
TLDR
This work develops a direct approach to reasoning in ABA with and without preferences by encoding ABA reasoning tasks in answer set programming, which significantly improves on the empirical performance of current ABA Reasoning systems.
Harnessing Incremental Answer Set Solving for Reasoning in Assumption-Based Argumentation
TLDR
This work develops non-trivial counterexample-guided abstraction refinement procedures based on incremental ASP solving for reasoning tasks in the logic programming fragment of ABA that are presumably hard for the second level of the polynomial hierarchy.
Declarative Algorithms and Complexity Results for Assumption-Based Argumentation
TLDR
A direct declarative approach to ABA reasoning by encoding ABA Reasoning tasks in answer set programming and suggests that the integration of preferential information into ABA via so-called reverse attacks results in increased problem complexity for several central argumentation semantics.
Approximate Inference for Assumption-based Argumentation in AI Master’s Thesis
TLDR
The evaluation shows that for reasoning in assumption-based argumentation, in general, the running time is reduced with the cost of slightly low accuracy by randomly sampling and constructing inference rules for potential arguments over a query.
Structural Constraints for Dynamic Operators in Abstract Argumentation
TLDR
This paper aims to support development of dynamic operators on formal models in abstract argumentation by providing constraints imposed on the modification of the structure that can be used to incorporate information that has been abstracted away.
Assumption-Based Argumentation Translated to Argumentation Frameworks ICCMA 2017 Benchmark Description
TLDR
This benchmark set consists of 426 instances, i.e., argumentation frameworks (AFs) in apx format, obtained from translating instances from assumptionbased argumentation (ABA) to AFs such that reasoning tasks on ABA frameworks can be carried out on the produced AF instances.
SAT-Based Approaches to Adjusting, Repairing, and Computing Largest Extensions of Argumentation Frameworks
TLDR
It is demonstrated that, especially on dense AFs, taking into account the local structure of AFs can have a significant positive effect on the overall solving efficiency, and that a specific MaxSAT approach yields quite generally good results.
Applications of ASP in Formal Argumentation
TLDR
The aim of this paper is to survey argumentation systems that use ASP technology inside and give an orthogonal view on several formalisms from the AI domain.
Assessment of benchmarks for abstract argumentation
TLDR
The benchmark suite from previous editions of the International Competition of Computational Models of Argumentation (ICCMA) is described, and the benchmarks for non-Dung frameworks are described.
Argument & Computation Community Resources ( ACCR ) Corner Assessment of benchmarks for abstract argumentation
TLDR
The benchmark suite from previous editions of the International Competition of Computational Models of Argumentation (ICCMA) is described, and the benchmarks for non-Dung frameworks are described.
...
1
2
...

References

SHOWING 1-10 OF 28 REFERENCES
Graph-Based Dispute Derivations in Assumption-Based Argumentation
TLDR
This work defines a new notion of graph-based dispute derivations for determining acceptability of claims under the grounded semantics in ABA, study formal properties and present an experimental evaluation thereof.
Hybrid argumentation and its properties
TLDR
A variant of AB-dispute derivations for assumption-based argumentation (ABA), that can be used for determining the admissibility of claims, and supports a hybrid of ABA and abstract argumentation beneficial to developing applications of argumentation where explicit justifications of claims in terms of full dialectical structures are required.
Computing Arguments and Attacks in Assumption-Based Argumentation
TLDR
This approach reduces the notion of an attack against an argument to that of deduction of a contrary of an assumption, and defines arguments as backward deductions supported by sets of assumptions.
A generalised framework for dispute derivations in assumption-based argumentation
A tutorial on assumption-based argumentation
We give an introductory tutorial to assumption-based argumentation (referred to as ABA) – a form of argumentation where arguments and attacks are notions derived from primitive notions of rules in a
Computing Preferred Extensions in Abstract Argumentation: A SAT-Based Approach
TLDR
A novel SAT-based approach for the computation of extensions in abstract argumentation, with focus on preferred semantics, and an empirical evaluation of its performances.
On the Difference between Assumytion-Based Argumentation and Abstract Argumentation
TLDR
Although these are often claimed to be equivalent, it is observed that there exist well-studied admissibility-based semantics (semi-stable and eager) under which equivalence does not hold.
Complexity-sensitive decision procedures for abstract argumentation
Argument graphs and assumption-based argumentation
Introduction to structured argumentation
TLDR
Structured argumentation is the topic of this special issue of Argument and Computation, which assumes a formal language for representing knowledge, and specifying how arguments and counterarguments can be constructed from that knowledge.
...
1
2
3
...