Methods for solving reasoning problems in abstract argumentation – A survey

Charwat, Günther; Dvořák, Wolfgang; Gaggl, Sarah Alice; Wallner, Johannes; Woltran, Stefan

doi:10.1016/j.artint.2014.11.008

Cited by 102 publications

(57 citation statements)

References 106 publications

(197 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…1 for an example of an argument graph with supporting and attacking arguments), and probabilities [43,72,74,82,92,135]. Furthermore, there has been the development of software solvers for determining extensions (see for example [33,137]), and the application of natural language processing techniques for constructing argument graphs from free text (see for example [93]). In addition, there are methods for argument dynamics to ensure that specific arguments hold in the extensions of the argument graph such as epistemic enforcement in abstract argumentation [9,10,38], revision of argument graphs [36,37], and belief revision in argumentation (e.g.…”

Section: Dialectical Levelmentioning

confidence: 99%

Towards a framework for computational persuasion with applications in behaviour change1

Hunter

2018

AAC

View full text Add to dashboard Cite

Abstract. Persuasion is an activity that involves one party trying to induce another party to believe something or to do something. It is an important and multifaceted human facility. Obviously, sales and marketing is heavily dependent on persuasion. But many other activities involve persuasion such as a doctor persuading a patient to drink less alcohol, a road safety expert persuading drivers to not text while driving, or an online safety expert persuading users of social media sites to not reveal too much personal information online. As computing becomes involved in every sphere of life, so too is persuasion a target for applying computer-based solutions. An automated persuasion system (APS) is a system that can engage in a dialogue with a user (the persuadee) in order to persuade the persuadee to do (or not do) some action or to believe (or not believe) something. To do this, an APS aims to use convincing arguments in order to persuade the persuadee. Computational persuasion is the study of formal models of dialogues involving arguments and counterarguments, of user models, and strategies, for APSs. A promising application area for computational persuasion is in behaviour change. Within healthcare organizations, government agencies, and non-governmental agencies, there is much interest in changing behaviour of particular groups of people away from actions that are harmful to themselves and/or to others around them.

show abstract

Section: Dialectical Levelmentioning

confidence: 99%

Towards a framework for computational persuasion with applications in behaviour change1

Hunter

2018

AAC

View full text Add to dashboard Cite

show abstract

“…For instance, let us consider the following query for the AF in Example 1, Here, the 3rd variable of X, denoted by X [3], is previously specified by Boolean 1, and the remaining variables are kept unknown, represented by "_" in Prolog languages. The goal of this query is to find all possible complete extensions that contain argument x 3 .…”

Section: Advance Queryingmentioning

confidence: 99%

“…Based on these, various semantics have been established, such as grounded, complete, and stable (see [2] for an overview). However, finding extensions can be a complex procedure when done without any computational help, when the AF contains numerous arguments and attacks [3].…”

Section: Introductionmentioning

confidence: 99%

Encoding Argumentation Semantics by Boolean Algebra

Luo

Zhou

2017

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYIn this paper, a Boolean algebra approach is proposed to encode various acceptability semantics for abstract argumentation frameworks, where each semantics can be equivalently encoded into several Boolean constraint models based on Boolean matrices and a family of Boolean operations between them. Then, we show that these models can be easily translated into logic programs, and can be solved by a constraint solver over Boolean variables. In addition, we propose some querying strategies to accelerate the calculation of the grounded, stable and complete extensions. Finally, we describe an experimental study on the performance of our encodings according to different semantics and querying strategies.

show abstract

“…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%

Abstract solvers for Dung’s argumentation frameworks

Brochenin

Linsbichler

Maratea

et al. 2018

AAC

Self Cite

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

Methods for solving reasoning problems in abstract argumentation – A survey

Cited by 102 publications

References 106 publications

Towards a framework for computational persuasion with applications in behaviour change1

Towards a framework for computational persuasion with applications in behaviour change1

Encoding Argumentation Semantics by Boolean Algebra

Abstract solvers for Dung’s argumentation frameworks

Contact Info

Product

Resources

About