On computing the set of acceptable arguments in abstract argumentation
From MaRDI portal
Recommendations
- Indepth combinatorial analysis of admissible sets for abstract argumentation
- Computing strongly admissible sets
- Complexity-sensitive decision procedures for abstract argumentation
- On the computation of Top-k extensions in abstract argumentation frameworks
- Algorithms for decision problems in argument systems under preferred semantics
Cited in
(27)- Augmenting tractable fragments of abstract argumentation
- Towards fixed-parameter tractable algorithms for abstract argumentation
- Indepth combinatorial analysis of admissible sets for abstract argumentation
- Deliberative acceptability of arguments
- Algorithms for computing the set of acceptable arguments
- On checking skeptical and ideal admissibility in abstract argumentation frameworks
- The complexity of the warranted formula problem in propositional argumentation
- Solving set optimization problems by cardinality optimization with an application to argumentation
- On the acceptance of loops in argumentation frameworks
- Revisiting approximate reasoning based on grounded semantics
- Acceptance in incomplete argumentation frameworks
- On the computation of Top-k extensions in abstract argumentation frameworks
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
- Looking-ahead in backtracking algorithms for abstract argumentation
- Algorithms for decision problems in argument systems under preferred semantics
- On the resolution-based family of abstract argumentation semantics and its grounded instance
- Computing preferred labellings by exploiting SCCs and most sceptically rejected arguments
- Advanced SAT techniques for abstract argumentation
- On the efficient implementation of social abstract argumentation
- scientific article; zbMATH DE number 2087874 (Why is no real title available?)
- Automata, Languages and Programming
- Algorithms and complexity results for persuasive argumentation
- The choice-preferred semantics for relevance-oriented acceptance of admissible sets of arguments
- Computing preferred extensions in abstract argumentation: a SAT-based approach
- Computing strongly admissible sets
- Coherence in finite argument systems.
- Open problems in abstract argumentation
This page was built for publication: On computing the set of acceptable arguments in abstract argumentation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145819)
