How we designed winning algorithms for abstract argumentation and which insight we attained
DOI10.1016/J.ARTINT.2019.08.001zbMATH Open1478.68318OpenAlexW2964722251MaRDI QIDQ2289004FDOQ2289004
Authors: Federico Cerutti, Massimiliano Giacomin, Mauro Vallati 
Publication date: 20 January 2020
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: http://orca.cf.ac.uk/124671/1/argsemsat_journal.pdf
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
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Knowledge representation (68T30) Logic in artificial intelligence (68T27)
Cites Work
- Theory and Applications of Satisfiability Testing
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- Title not available (Why is that?)
- Theory and Applications of Satisfiability Testing
- Algorithm runtime prediction: methods \& evaluation
- On generating all maximal independent sets
- Floating conclusions and zombie paths: Two deep difficulties in the ``directly skeptical approach to defeasible inheritance nets
- The Decision Problem for a Class of First‐Order Formulas in Which all Disjunctions are Binary
- Argumentation Semantics for Defeasible Logic
- The first international competition on computational models of argumentation: results and analysis
- A logical account of formal argumentation
- Methods for solving reasoning problems in abstract argumentation -- a survey
- On the Issue of Reinstatement in Argumentation
- Computing preferred extensions in abstract argumentation: a SAT-based approach
- Lazy clause exchange policy for parallel SAT solvers
- Complexity-sensitive decision procedures for abstract argumentation
- Improving resource-unaware SAT solvers
- Towards fixed-parameter tractable algorithms for abstract argumentation
- SCC-recursiveness: a general schema for argumentation semantics
- Eliminating Redundant Clauses in SAT Instances
- Title not available (Why is that?)
- The configurable SAT solver challenge (CSSC)
- Automatic construction of parallel portfolios via algorithm configuration
- On efficiently estimating the probability of extensions in abstract argumentation frameworks
- On the equivalence between logic programming semantics and argumentation semantics
- Advanced SAT techniques for abstract argumentation
- On the impact of configuration on abstract argumentation automated reasoning
- Automata for infinite argumentation structures
- Incremental computation of deterministic extensions for dynamic argumentation frameworks
- Title not available (Why is that?)
- Solving set optimization problems by cardinality optimization with an application to argumentation
- Advanced Portfolio Techniques
- Computing preferred labellings by exploiting SCCs and most sceptically rejected arguments
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
Uses Software
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)
