Acceptance in incomplete argumentation frameworks
From MaRDI portal
Recommendations
- Credulous and skeptical acceptance in incomplete argumentation frameworks
- Verification in incomplete argumentation frameworks
- Complexity-sensitive decision procedures for abstract argumentation
- Complexity of Possible and Necessary Existence Problems in Abstract Argumentation
- On computing the set of acceptable arguments in abstract argumentation
Cites work
- A general notion of equivalence for abstract argumentation
- A relevance-theoretic framework for constructing and deconstructing enthymemes
- Augmenting tractable fragments of abstract argumentation
- Change in abstract argumentation frameworks: adding an argument
- Coherence in finite argument systems.
- Complexity of Possible and Necessary Existence Problems in Abstract Argumentation
- Complexity results and algorithms for extension enforcement in abstract argumentation
- Complexity theory and cryptology. An introduction to cryptocomplexity.
- Complexity-sensitive decision procedures for abstract argumentation
- Computational properties of argument systems satisfying graph-theoretic constraints
- Context-free and context-sensitive kernels: update and deletion equivalence in abstract argumentation
- Counterexample-guided abstraction refinement for symbolic model checking
- Credulous and skeptical acceptance in incomplete argumentation frameworks
- Design and results of the second international competition on computational models of argumentation
- Dynamics in Argumentation with Single Extensions: Abstraction Principles and the Grounded Extension
- Dynamics of argumentation systems: a division-based method
- Graph theoretical structures in logic programs and default theories
- How we designed winning algorithms for abstract argumentation and which insight we attained
- scientific article; zbMATH DE number 3888913 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- Incremental computation of deterministic extensions for dynamic argumentation frameworks
- Normal and strong expansion equivalence for argumentation frameworks
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
- On the complexity of probabilistic abstract argumentation frameworks
- On the instantiation of knowledge bases in abstract argumentation frameworks
- On the intertranslatability of argumentation semantics
- On the Issue of Reinstatement in Argumentation
- On the merging of Dung's argumentation systems
- On topology-related properties of abstract argumentation semantics. A correction and extension to ``Dynamics of argumentation systems: a division-based method
- Persistence and monotony properties of argumentation semantics
- PP is as Hard as the Polynomial-Time Hierarchy
- Preprocessing argumentation frameworks via replacement patterns
- SAT-based approaches to adjusting, repairing, and computing largest extensions of argumentation frameworks
- SCC-recursiveness: a general schema for argumentation semantics
- Solving set optimization problems by cardinality optimization with an application to argumentation
- Strong refinements for hard problems in argumentation dynamics
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Synthesizing argumentation frameworks from examples
- The Boolean Hierarchy I: Structural Properties
- The complexity of facets (and some facets of complexity)
- The difference and truth-table hierarchies for NP
- The polynomial-time hierarchy
- Towards fixed-parameter tractable algorithms for abstract argumentation
- Verification in argument-incomplete argumentation frameworks
- Verification in attack-incomplete argumentation frameworks
- Verification in incomplete argumentation frameworks
- What does it take to enforce an argument? Minimal change in abstract argumentation
Cited in
(37)- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
- 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
- Computing smallest MUSes of quantified Boolean formulas
- Abstract argumentation with qualitative uncertainty: an analysis in dynamic logic
- Extension-based semantics for incomplete argumentation frameworks
- On the acceptance of loops in argumentation frameworks
- Verification in attack-incomplete argumentation frameworks
- Verification in argument-incomplete argumentation frameworks
- Acceptance, inference, and the multiple-conclusion sequent
- Synthesizing argumentation frameworks from examples
- Explaining non-acceptability in abstract argumentation
- Abstract argumentation frameworks with fallible evidence
- I don't care, I don't know \(\dots \) I know too much! on incompleteness and undecidedness in abstract argumentation
- Credulous and skeptical acceptance in incomplete argumentation frameworks
- Towards Evidence Retrieval Cost Reduction in Abstract Argumentation Frameworks with Fallible Evidence
- 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
- On dynamics in structured argumentation formalisms
- Credulous acceptance in high-order argumentation frameworks with necessities: an incremental approach
- Extension-based semantics for incomplete argumentation frameworks: grounded semantics and principles
- Efficient analysis of belief properties in process algebra
- How to manage supports in incomplete argumentation
- Verification in incomplete argumentation frameworks
- Relevance for stability of verification status of a set of arguments in incomplete argumentation frameworks
- Incomplete higher-order abstract argumentation frameworks
- Argumentative reasoning in ASPIC^+ under incomplete information
- Stability of extensions in incomplete argumentation frameworks
- ICCMA 2023: 5th international competition on computational models of argumentation
- An abstract and structured account of dialectical argument strength
- Grounded semantics and principle-based analysis for incomplete argumentation frameworks
- Revisiting the notions of extension and acceptance over incomplete abstract argumentation frameworks
- Totality, determinism and functionality problems in (incomplete) abstract argumentation frameworks
This page was built for publication: Acceptance in incomplete argumentation frameworks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2238645)
