How we designed winning algorithms for abstract argumentation and which insight we attained
From MaRDI portal
Publication:2289004
Recommendations
- New stochastic local search approaches for computing preferred extensions of abstract argumentation
- Algorithms for decision problems in argument systems under preferred semantics
- Computing preferred extensions in abstract argumentation: a SAT-based approach
- On the impact of configuration on abstract argumentation automated reasoning
- Complexity-sensitive decision procedures for abstract argumentation
Cites work
- scientific article; zbMATH DE number 6934384 (Why is no real title available?)
- scientific article; zbMATH DE number 1903357 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- A logical account of formal argumentation
- Advanced Portfolio Techniques
- Advanced SAT techniques for abstract argumentation
- Algorithm runtime prediction: methods \& evaluation
- Argumentation Semantics for Defeasible Logic
- Automata for infinite argumentation structures
- Automatic construction of parallel portfolios via algorithm configuration
- Complexity-sensitive decision procedures for abstract argumentation
- Computing preferred extensions in abstract argumentation: a SAT-based approach
- Computing preferred labellings by exploiting SCCs and most sceptically rejected arguments
- Eliminating Redundant Clauses in SAT Instances
- Floating conclusions and zombie paths: Two deep difficulties in the ``directly skeptical approach to defeasible inheritance nets
- Improving resource-unaware SAT solvers
- Incremental computation of deterministic extensions for dynamic argumentation frameworks
- Lazy clause exchange policy for parallel SAT solvers
- Methods for solving reasoning problems in abstract argumentation -- a survey
- On efficiently estimating the probability of extensions in abstract argumentation frameworks
- On generating all maximal independent sets
- On the Issue of Reinstatement in Argumentation
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
- On the equivalence between logic programming semantics and argumentation semantics
- On the impact of configuration on abstract argumentation automated reasoning
- SCC-recursiveness: a general schema for argumentation semantics
- Solving set optimization problems by cardinality optimization with an application to argumentation
- The Decision Problem for a Class of First‐Order Formulas in Which all Disjunctions are Binary
- The configurable SAT solver challenge (CSSC)
- The first international competition on computational models of argumentation: results and analysis
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Towards fixed-parameter tractable algorithms for abstract argumentation
Cited in
(7)- Design and results of the second international competition on computational models of argumentation
- Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving
- Acceptance in incomplete argumentation frameworks
- A logical encoding for \(k\)-\(m\)-realization of extensions in abstract argumentation
- On the impact of configuration on abstract argumentation automated reasoning
- The first international competition on computational models of argumentation: results and analysis
- Graded labellings for abstract argumentation
This page was built for publication: How we designed winning algorithms for abstract argumentation and which insight we attained
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2289004)
