CoQuiAAS: A Constraint-Based Quick Abstract Argumentation Solver

Lagniez, Jean-Marie; Lonca, Emmanuel; Mailly, Jean-Guy

doi:10.1109/ictai.2015.134

Cited by 26 publications

(25 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [72], the encoding proposed by Besnard and Doutre in [11] is used in two different ways. First, it is used directly in a SAT solver for computing the semantics that are in the first level of the polynomial hierarchy.…”

Section: Some Implementationsmentioning

confidence: 99%

Logical theories and abstract argumentation: A survey of existing works

Besnard

Cayrol

Lagasquie-Schiex

2020

AAC

View full text Add to dashboard Cite

In 1995, in his seminal paper introducing the abstract argumentation framework, Dung has also established the first relationship between this framework and a logical framework (in this case: logic programming). Since that time, a lot of work have pursued this path, proposing different definitions, uses and exhibiting distinct relationships between argumentation and logic. In this paper, we present a survey of existing works about this topic and more especially those that address the following question: "How logic has been used for capturing various aspects or parts of Dung's argumentation". This survey covers many different approaches but is not intended to be totally exhaustive due to the huge quantity of papers in this scope. Moreover, due to the fact that each approach has its own specificities, sometimes antagonistic with the other approaches, and is also justified by its own context of definition or use, the aim of this survey is not to identify one approach as being better than another.

show abstract

Section: Some Implementationsmentioning

confidence: 99%

Logical theories and abstract argumentation: A survey of existing works

Besnard

Cayrol

Lagasquie-Schiex

2020

AAC

View full text Add to dashboard Cite

show abstract

“…Moreover in the context of the First International Competition on Computational Models of Argumentation (ICCMA), different solvers have been proposed and tested (e.g. [26], or [27]). However, in all these works, neither the attack relation itself is logically encoded, nor the recursive aspects are taken into account.…”

Section: Case Of Afmentioning

confidence: 99%

Logical Encoding of Argumentation Frameworks with Higher-Order Attacks

Cayrol¹,

Lagasquie-Schiex²

2018

2018 IEEE 30th International Conference on Tools With Artificial Intelligence (ICTAI)

View full text Add to dashboard Cite

show abstract

“…The first two places were taken by ArgSemSAT and CEGARTIX, whose algorithms are described in terms of abstract solvers in Sections 3.1 and 3.2, respectively. The other solvers in the top five were LabSATSolver, ASPARTIX-V [28] and CoQuiAAS [32] (system descriptions of all participating solvers can be found in [49]). While LabSATSolver uses the same algorithm as ArgSemSAT for this particular task, ASPARTIX-V and CoQuiAAS are reduction-based approaches, using translations to ASP and a particular variant of Max-SAT, respectively.…”

Section: Related Workmentioning

confidence: 99%

Abstract solvers for Dung’s argumentation frameworks

Brochenin

Linsbichler

Maratea

et al. 2018

AAC

View full text Add to dashboard Cite

TU Wien, Austria E-mails: linsbich@dbai.tuwien.ac.at, wallner@dbai.tuwien.ac.at, woltran@dbai.tuwien.ac.at Abstract. Abstract solvers are a quite recent method to uniformly describe algorithms in a rigorous formal way via graphs. Compared to traditional methods like pseudo-code descriptions, abstract solvers have several advantages. In particular, they provide a uniform formal representation that allows for precise comparisons of different algorithms. Recently, this new methodology has proven successful in declarative paradigms such as Propositional Satisfiability and Answer Set Programming. In this paper, we apply this machinery to Dung's abstract argumentation frameworks. We first provide descriptions of several advanced algorithms for the preferred semantics in terms of abstract solvers. We also show how it is possible to obtain new abstract solutions by "combining" concepts of existing algorithms by means of combining abstract solvers. Then, we implemented a new solving procedure based on our findings in CEGARTIX, and call it CEGARTIX+. We finally show that CEGARTIX+ is competitive and complementary in its performance to CEGARTIX on benchmarks of the first and second argumentation competition.Keywords: Abstract argumentation, abstract solvers IntroductionDung's concept of abstract argumentation [23] is nowadays a core formalism in Artificial Intelligence [4,46]. The problem of solving certain reasoning tasks on such frameworks is the centerpiece of many advanced higher-level argumentation systems. The problems to be solved can however be intractable and might even be hard for the second level of the polynomial hierarchy [24,26]. Thus, efficient and advanced algorithms have to be developed in order to deal with real-world size data within reasonable performance bounds. The argumentation community is currently facing this challenge [17] [44]. Hereby, one characterizes the possible states of computation as nodes of a graph, and the techniques (i.e., the computation steps in the algorithms) as arcs between nodes. In this way, the whole solving process amounts to a path in the graph. This concept proved successful for SAT [44], and also has been applied to several variants of Answer Set Programming [6,36,37].In this paper, we apply abstract solvers to certain problems in Dung's argumentation frameworks. In order to understand whether abstract solvers are well suited also for this domain, we consider quite advanced algorithms for solving problems that are hard for the second level of the polynomial hierarchy -the considered algorithms range from dedicated [45] to reduction-based [13,25] approaches (see [19] for a survey). We show that abstract solvers allow for convenient algorithms design resulting in a clear and mathematically precise description. Moreover, formal properties of the algorithms (i.e. correctness) are easily specified by means of related graph properties (i.e. reachability). We then illustrate how abstract solvers allow to highlight in a more clear way similarities and differences among solvin...

show abstract

CoQuiAAS: A Constraint-Based Quick Abstract Argumentation Solver

Cited by 26 publications

References 17 publications

Logical theories and abstract argumentation: A survey of existing works

Logical theories and abstract argumentation: A survey of existing works

Logical Encoding of Argumentation Frameworks with Higher-Order Attacks

Abstract solvers for Dung’s argumentation frameworks

Contact Info

Product

Resources

About