Algorithms for decision problems in argument systems under preferred semantics

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

doi:10.1016/j.artint.2013.11.001

Cited by 48 publications

(39 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Further work by different authors following the same idea was published later, e.g. [3][4][5][6][7]. However, all these approaches were devoted to specific cases in the sense that for each semantics, a dedicated encoding was proposed from scratch.…”

Section: Introductionmentioning

confidence: 99%

Encoding Argument Graphs in Logic

Besnard

Doutre

Herzig

2014

Information Processing and Management of Uncertainty in Knowledge-Based Systems

View full text Add to dashboard Cite

OATAO is an open access repository that collects the work of Toulouse researchers and makes it freely available over the web where possible. This is an author-deposited version published in : http://oatao.univ-toulouse.fr/ Eprints ID : 12983 Any correspondance concerning this service should be sent to the repository administrator: staff-oatao@listes-diff.inp-toulouse.fr Encoding Argument Graphs in LogicPhilippe Besnard, Sylvie Doutre, and Andreas Herzig IRIT-CNRS, University of Toulouse, France {besnard,doutre,herzig}@irit.frAbstract. Argument graphs are a common way to model argumentative reasoning. For reasoning or computational purposes, such graphs may have to be encoded in a given logic. This paper aims at providing a systematic approach for this encoding. This approach relies upon a general, principle-based characterization of argumentation semantics.

show abstract

Section: Introductionmentioning

confidence: 99%

Encoding Argument Graphs in Logic

Besnard

Doutre

Herzig

2014

Information Processing and Management of Uncertainty in Knowledge-Based Systems

View full text Add to dashboard Cite

show abstract

“…Moreover, we abstract the dedicated approach for enumeration of [45]. Finally, in Section 3.4 we show how our graph representations can be used to develop a novel algorithm, by combining parts of CEGARTIX and DP ≺ .…”

Section: Algorithms For Preferred Semanticsmentioning

confidence: 99%

“…• We provide a full formal description of recent algorithms [13,25,45] for reasoning tasks under the preferred semantics in terms of abstract solvers, thus enabling a comparison of these approaches at a formal level.…”

Section: Introductionmentioning

confidence: 99%

“…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.…”

Section: Introductionmentioning

confidence: 99%

“…This is an interesting result which shows that a combination based on abstract solvers is proven to be also useful in practice (for similar observations, see [36,44]). We finally show (with focus on CEGARTIX), how reasoning tasks under further semantics, other than preferred, can be solved with this framework, and demonstrate how optimizations are easily added to our abstract solvers in a modular way.To sum up, our main contributions are as follows:• We provide a full formal description of recent algorithms [13,25,45] for reasoning tasks under the preferred semantics in terms of abstract solvers, thus enabling a comparison of these approaches at a formal level.• We outline how our formal descriptions can be used to gain more insight into the algorithms, and how certain combinations can pave the way for new solutions.• We implement such a new solution inside CEGARTIX and analyze its performance.• We show how other semantics and optimizations can be incorporated to our abstract solvers.The paper is structured as follows. Section 2 introduces the required preliminaries about abstract argumentation frameworks and abstract solvers.…”

mentioning

confidence: 99%

See 2 more Smart Citations

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

ASPARTIX-V19 - An Answer-Set Programming Based System for Abstract Argumentation

Dvořák

Rapberger

Wallner

et al. 2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We present ASPARTIX-V, a tool for reasoning in abstract argumentation frameworks that is based on answer-set programming (ASP), in its 2019 release. ASPARTIX-V participated in this year's edition of the International Competition on Computational Models of Argumentation (ICCMA'19) in all classical (static) reasoning tasks. In this paper we discuss extensions the ASPARTIX suite of systems has undergone for ICCMA'19. This includes incorporation of recent ASP language constructs (e.g. conditional literals), domain heuristics within ASP, and multi-shot methods. In particular, with this version of ASPARTIX-V we partially deviate from an earlier focus on monolithic approaches (i.e., one-shot solving via a single ASP encoding) to further enhance performance. We also briefly report on the results achieved by ASPARTIX-V in ICCMA'19.

show abstract

Algorithms for decision problems in argument systems under preferred semantics

Cited by 48 publications

References 23 publications

Encoding Argument Graphs in Logic

Encoding Argument Graphs in Logic

Abstract solvers for Dung’s argumentation frameworks

ASPARTIX-V19 - An Answer-Set Programming Based System for Abstract Argumentation

Contact Info

Product

Resources

About