Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/ios-press/abstract-solvers-for-dung-s-argumentation-frameworks-Qvwd6KvBby
References (39)
-
10.1007/978-3-642-20895-9_6
-
Davis (1962)
A machine program for theorem provingCommunications of the ACM, 5
-
10.1007/978-3-642-40624-9_9
-
Nieuwenhuis (2006)
Solving SAT and SAT modulo theories: From an abstract Davis–Putnam–Logemann–Loveland procedure to DPLL(T)Journal of the ACM, 53
-
10.1007/978-0-387-98197-0_6
-
10.1007/978-3-319-24309-2_16
-
10.1609/aaai.v29i1.9390
-
Caminada (2012)
Semi-stable semanticsJournal of Logic and Computation, 22
-
Lierler (2011)
Abstract answer set solvers with backjumping and learningTheory and Practice of Logic Programming, 11
-
Gebser (2012)
Conflict-driven answer set solving: From theory to practiceArtificial Intelligence, 187
-
10.1007/978-3-319-28460-6_3
-
Charwat (2015)
Methods for solving reasoning problems in abstract argumentation – A surveyArtificial Intelligence, 220
-
Dung (1995)
On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person gamesArtificial Intelligence, 77
-
Lierler (2016)
On abstract modular inference systems and solversArtificial Intelligence, 236
-
Gaggl (2015)
Improved answer-set programming encodings for abstract argumentationTheory and Practice of Logic Programming, 15
-
Lierler (2011)
Transition systems for model generators – A unifying approachTheory and Practice of Logic Programming, 11
-
Bench-Capon (2007)
Argumentation in artificial intelligenceArtificial Intelligence, 171
-
10.1007/978-3-319-04132-2_4
-
Dvořák (2014)
Complexity-sensitive decision procedures for abstract argumentationArtificial Intelligence, 206
-
10.1007/978-3-540-89982-2_35
-
Brochenin (2016)
Disjunctive answer set solvers via templatesTheory and Practice of Logic Programming, 16
-
Nofal (2014)
Algorithms for decision problems in argument systems under preferred semanticsArtificial Intelligence, 207
-
10.1007/978-0-387-98197-0
-
Baroni (2011)
An introduction to argumentation semanticsThe Knowledge Engineering Review, 26
-
Rosa (2010)
Solving satisfiability problems with preferencesConstraints, 15
-
Järvisalo (2009)
Limitations of restricted branching in clause learningConstraints, 14
-
Järvisalo (2008)
The effect of structural branching on the efficiency of clause learning SAT solving: An experimental studyJournal of Algorithms, 63
-
Thimm (2017)
The first international competition on computational models of argumentation: Results and analysisArtificial Intelligence, 252
-
Dvořák (2010)
Complexity of semi-stable and stage semantics in argumentation frameworksInformation Processing Letters, 110
-
Thimm (2016)
Summary report of the first international competition on computational models of argumentationAI Magazine, 37
-
Liao (2013)
Toward incremental computation of argumentation semantics: A decomposition-based approachAnnals of Mathematics and Artificial Intelligence, 67
-
10.1007/3-540-45744-5_20
-
Lierler (2014)
Relating constraint answer set programming languages and algorithmsArtificial Intelligence, 207
-
10.1007/978-3-319-14726-0_19
-
Dunne (2002)
Coherence in finite argument systemsArtificial Intelligence, 141
-
10.1109/ICTAI.2015.134
-
Dimopoulos (1996)
Graph theoretical structures in logic programs and default theoriesTheoretical Computer Science, 170
-
10.1007/978-3-642-54373-9_12
-
Sebastiani (2007)
Lazy satisfiability modulo theoriesJournal of Satisfiability, Boolean Modeling and Computation, 3
- Publisher
- IOS Press
- Copyright
- Copyright © 2018 © 2018 – IOS Press and the authors.
- ISSN
- 1946-2166
- eISSN
- 1946-2174
- DOI
- 10.3233/AAC-170031
- Publisher site
- See Article on Publisher Site
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.
Journal
Argument & Computation – IOS Press
Published: Jan 1, 2018