Looking-ahead in backtracking algorithms for abstract argumentation

Nofal, Samer; Atkinson, Katie; Dunne, Paul E.

doi:10.1016/j.ijar.2016.07.013

Cited by 17 publications

(6 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Runtime comparisons with and without preprocessing under stable semantics are shown for ArgTools [15], Heureka [21], and CEGARTIX [10] in Figure 4, with the runtime of the original instance on the x-axis and the runtime of the preprocessed instance on the y-axis (with preprocessing time included). Applying the patterns has a strong effect on the runtimes of the native AF solvers ArgTools (Fig.…”

Section: Empirical Evaluationmentioning

confidence: 99%

“…We provide a set of concrete polynomial-time checkable replacement patterns which we consider as a first suite of solver-independent AF preprocessing techniques for stable, preferred, and complete semantics. We further study the impact of our preprocessing routine via a preliminary empirical evaluation on both two state-of-the-art native AF solvers [15,21] and a SAT-based AF solver [10,12] on the task of extension enumeration. Our results reveal that in particular the native solvers can highly benefit from pre-processing; also the performance of constraint-based solvers can be improved at times.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Preprocessing Argumentation Frameworks via Replacement Patterns

Dvořák

Järvisalo

Linsbichler

et al. 2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

A fast-growing research direction in the study of formal argumentation is the development of practical systems for central reasoning problems underlying argumentation. In particular, numerous systems for abstract argumentation frameworks (AF solvers) are available today, covering several argumentation semantics and reasoning tasks. Instead of proposing another algorithmic approach for AF solving, we introduce in this paper distinct AF preprocessing techniques as a solver-independent approach to obtaining performance improvements of AF solvers. We establish a formal framework of replacement patterns to perform local simplifications that are faithful with respect to standard semantics for AFs. Moreover, we provide a collection of concrete replacement patterns. Towards potential applicability, we employ the patterns in a preliminary empirical evaluation of their influence on AF solver performance.

show abstract

Section: Empirical Evaluationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Preprocessing Argumentation Frameworks via Replacement Patterns

Dvořák

Järvisalo

Linsbichler

et al. 2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…We define some labellings which correspond to the different states of our algorithm while traversing the binary tree. These definitions and the algorithms following them are inspired by the corresponding work for AFs, particularly [28]. In the above, the initial labelling corresponds to the root of the binary tree.…”

Section: Enumeration Of Preferred Extensionsmentioning

confidence: 99%

“…4.1.2 Improved Algorithm. We now discuss several improvements of the basic algorithm given above, similarly to [28].…”

Section: Enumeration Of Preferred Extensionsmentioning

confidence: 99%

Complexity Results and Algorithms for Bipolar Argumentation

Karamlou,

Čyras,

Toni

2019

Preprint

View full text Add to dashboard Cite

Bipolar Argumentation Frameworks (BAFs) admit several interpretations of the support relation and diverging definitions of semantics. Recently, several classes of BAFs have been captured as instances of bipolar Assumption-Based Argumentation, a class of Assumption-Based Argumentation (ABA). In this paper, we establish the complexity of bipolar ABA, and consequently of several classes of BAFs. In addition to the standard five complexity problems, we analyse the rarely-addressed extension enumeration problem too. We also advance backtracking-driven algorithms for enumerating extensions of bipolar ABA frameworks, and consequently of BAFs under several interpretations. We prove soundness and completeness of our algorithms, describe their implementation and provide a scalability evaluation. We thus contribute to the study of the as yet uninvestigated complexity problems of (variously interpreted) BAFs as well as of bipolar ABA, and provide the lacking implementations thereof.

show abstract

“…AFs allow for representing conflicts-or attacks-between arguments as directed graphs, where nodes represent abstract arguments, and edges represent attacks. Several reasoning system implementations for AF reasoning exists today [18,17,5,6,24,25], especially for central AF reasoning problems such as credulous and skeptical acceptance of arguments under various AF semantics.…”

Section: Introductionmentioning

confidence: 99%

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

Lehtonen

Wallner

Järvisalo

2017

Lecture Notes in Computer Science

View full text Add to dashboard Cite

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 show that the approach is complementary with a state-of-the-art ABA reasoning system.

show abstract

Looking-ahead in backtracking algorithms for abstract argumentation

Cited by 17 publications

References 14 publications

Preprocessing Argumentation Frameworks via Replacement Patterns

Preprocessing Argumentation Frameworks via Replacement Patterns

Complexity Results and Algorithms for Bipolar Argumentation

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

Contact Info

Product

Resources

About