Acceptance in incomplete argumentation frameworks
From MaRDI portal
Publication:2238645
DOI10.1016/j.artint.2021.103470OpenAlexW3126150892MaRDI QIDQ2238645
Daniel Neugebauer, Jörg Rothe, Dorothea Baumeister, Matti Järvisalo, Andreas Niskanen
Publication date: 2 November 2021
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2021.103470
computational complexityempirical evaluationincomplete knowledgedecision proceduresabstract argumentationincomplete argumentation frameworks
Related Items
Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving, The possible winner problem with uncertain weights revisited, Constrained incomplete argumentation frameworks, Explainable acceptance in probabilistic and incomplete abstract argumentation frameworks, The complexity landscape of claim-augmented argumentation frameworks, The possible winner with uncertain weights problem, Taking into account ``who said what in abstract argumentation: complexity results, On incompleteness in abstract argumentation: complexity and expressiveness, Computing smallest MUSes of quantified Boolean formulas, Abstract argumentation with qualitative uncertainty: an analysis in dynamic logic, Extension-based semantics for incomplete argumentation frameworks, Towards Evidence Retrieval Cost Reduction in Abstract Argumentation Frameworks with Fallible Evidence
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Normal and strong expansion equivalence for argumentation frameworks
- Complexity-sensitive decision procedures for abstract argumentation
- Dynamics of argumentation systems: a division-based method
- Verification in incomplete argumentation frameworks
- Graph theoretical structures in logic programs and default theories
- Computational properties of argument systems satisfying graph-theoretic constraints
- On the merging of Dung's argumentation systems
- The complexity of facets (and some facets of complexity)
- The polynomial-time hierarchy
- Towards fixed-parameter tractable algorithms for abstract argumentation
- Augmenting tractable fragments of abstract argumentation
- Coherence in finite argument systems.
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- Design and results of the second international competition on computational models of argumentation
- How we designed winning algorithms for abstract argumentation and which insight we attained
- Preprocessing argumentation frameworks via replacement patterns
- A general notion of equivalence for abstract argumentation
- On topology-related properties of abstract argumentation semantics. A correction and extension to ``Dynamics of argumentation systems: a division-based method
- SCC-recursiveness: a general schema for argumentation semantics
- Complexity theory and cryptology. An introduction to cryptocomplexity.
- Persistence and Monotony Properties of Argumentation Semantics
- Incremental Computation of Deterministic Extensions for Dynamic Argumentation Frameworks
- On the Instantiation of Knowledge Bases in Abstract Argumentation Frameworks
- On the Complexity of Probabilistic Abstract Argumentation Frameworks
- On the Intertranslatability of Argumentation Semantics
- A Relevance-theoretic Framework for Constructing and Deconstructing Enthymemes
- PP is as Hard as the Polynomial-Time Hierarchy
- Verification in Attack-Incomplete Argumentation Frameworks
- Verification in Argument-Incomplete Argumentation Frameworks
- Counterexample-guided abstraction refinement for symbolic model checking
- On the Issue of Reinstatement in Argumentation
- Change in Abstract Argumentation Frameworks: Adding an Argument
- Dynamics in Argumentation with Single Extensions: Abstraction Principles and the Grounded Extension
- The difference and truth-table hierarchies for NP
- The Boolean Hierarchy I: Structural Properties
- Solving Set Optimization Problems by Cardinality Optimization with an Application to Argumentation
- Synthesizing Argumentation Frameworks from Examples
- Strong Refinements for Hard Problems in Argumentation Dynamics
- Complexity of Possible and Necessary Existence Problems in Abstract Argumentation
- Complexity Results and Algorithms for Extension Enforcement in Abstract Argumentation
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
