Complexity-sensitive decision procedures for abstract argumentation
From MaRDI portal
Publication:490451
Recommendations
- On the complexity of probabilistic abstract argumentation frameworks
- Complexity of abstract argumentation under a claim-centric view
- Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks
- Towards fixed-parameter tractable algorithms for abstract argumentation
- Complexity of Possible and Necessary Existence Problems in Abstract Argumentation
- Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence
- Complexity Classifications for Logic-Based Argumentation
- On incompleteness in abstract argumentation: complexity and expressiveness
- Declarative algorithms and complexity results for assumption-based argumentation
- Complexity results and algorithms for extension enforcement in abstract argumentation
Cites work
- scientific article; zbMATH DE number 1769206 (Why is no real title available?)
- scientific article; zbMATH DE number 1903356 (Why is no real title available?)
- scientific article; zbMATH DE number 2090318 (Why is no real title available?)
- A QBF-based formalization of abstract argumentation semantics
- A logical account of formal argumentation
- Abstraction-based algorithm for 2QBF
- Augmenting tractable fragments of abstract argumentation
- Coherence in finite argument systems.
- Complex optimization in answer set programming
- Complexity of semi-stable and stage semantics in argumentation frameworks
- Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks
- Computational properties of argument systems satisfying graph-theoretic constraints
- Counterexample guided abstraction refinement algorithm for propositional circumscription
- Counterexample-guided abstraction refinement for symbolic model checking
- Digraphs. Theory, algorithms and applications
- GRASP: a search algorithm for propositional satisfiability
- Graph theoretical structures in logic programs and default theories
- Lazy satisfiability modulo theories
- NP is as easy as detecting unique solutions
- On bipolarity in argumentation frameworks
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- On the computational cost of disjunctive logic programming: Propositional case
- On the intertranslatability of argumentation semantics
- Parameterized splitting: a simple modification-based approach
- Reasoning about preferences in argumentation frameworks
- Solving QBF with counterexample guided refinement
- Splitting an Argumentation Framework
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- The computational complexity of ideal semantics
- Theorem proving using lazy proof explication.
- Theory and Applications of Satisfiability Testing
- Towards fixed-parameter tractable algorithms for abstract argumentation
- Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs
Cited in
(43)- Improved answer-set programming encodings for abstract argumentation
- Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving
- SAT-based approaches to adjusting, repairing, and computing largest extensions of argumentation frameworks
- On computing the set of acceptable arguments in abstract argumentation
- Explainable acceptance in probabilistic and incomplete abstract argumentation frameworks
- From structured to abstract argumentation: assumption-based acceptance via AF reasoning
- Using graph convolutional networks for approximate reasoning with abstract argumentation frameworks: a feasibility study
- Reduction-based approaches to implement Modgil's extended argumentation frameworks
- Automated Reasoning
- On the impact of configuration on abstract argumentation automated reasoning
- Design and results of the second international competition on computational models of argumentation
- Acceptance in incomplete argumentation frameworks
- Logics in Artificial Intelligence
- How we designed winning algorithms for abstract argumentation and which insight we attained
- Enumerating extensions on random abstract-AFs with ArgTools, ASPARTIX, ConArg2, and Dung-O-Matic
- The complexity landscape of claim-augmented argumentation frameworks
- On the resolution-based family of abstract argumentation semantics and its grounded instance
- New stochastic local search approaches for computing preferred extensions of abstract argumentation
- ASP and subset minimality: enumeration, cautious reasoning and MUSes
- The first international competition on computational models of argumentation: results and analysis
- Abstract solvers for Dung's argumentation frameworks
- Complexity of Possible and Necessary Existence Problems in Abstract Argumentation
- Synchronous counting and computational algorithm design
- What is a reasonable argumentation semantics?
- Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory
- On checking skeptical and ideal admissibility in abstract argumentation frameworks
- Not only size, but also shape counts: abstract argumentation solvers are benchmark-sensitive
- Pakota: a system for enforcement in abstract argumentation
- On the complexity of probabilistic abstract argumentation frameworks
- Strong refinements for hard problems in argumentation dynamics
- Nested Argumentation and Its Application to Decision Making over Actions
- Advanced SAT techniques for abstract argumentation
- Complexity of abstract argumentation under a claim-centric view
- On rejected arguments and implicit conflicts: the hidden power of argumentation semantics
- Computing preferred extensions in abstract argumentation: a SAT-based approach
- Abstract argumentation frameworks with fallible evidence
- Complexity of nonemptiness in control argumentation frameworks
- Complexity Classifications for Logic-Based Argumentation
- Argumentation reasoning via circumscription with \textsc{pyglaf}
- Methods for solving reasoning problems in abstract argumentation -- a survey
- Argumentation frameworks as constraint satisfaction problems
- Complexity results and algorithms for extension enforcement in abstract argumentation
- Incremental SAT-based method with native Boolean cardinality handling for the Hamiltonian cycle problem
This page was built for publication: Complexity-sensitive decision procedures for abstract argumentation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490451)
