Algorithms for decision problems in argument systems under preferred semantics
From MaRDI portal
Publication:490457
Recommendations
Cites work
- scientific article; zbMATH DE number 1759381 (Why is no real title available?)
- scientific article; zbMATH DE number 1769206 (Why is no real title available?)
- A logical account of formal argumentation
- A reasoning model based on the production of acceptable arguments
- AFRA: argumentation framework with recursive attacks
- Algorithms and complexity results for persuasive argumentation
- An Algorithm for Computing Semi-stable Semantics
- Argument based machine learning
- Argumentation in artificial intelligence
- Audiences in argumentation frameworks
- Computational properties of argument systems satisfying graph-theoretic constraints
- Computing ideal sceptical argumentation
- Dynamics of argumentation systems: a division-based method
- Easy problems for tree-decomposable graphs
- Logics in Artificial Intelligence
- Metalevel argumentation
- Monadic second-order evaluations on tree-decomposable graphs
- On Decision Problems Related to the Preferred Semantics for Argumentation Frameworks
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- Persuasion in Practical Argument Using Value-based Argumentation Frameworks
- Preferred extensions as stable models
- Reasoning about preferences in argumentation frameworks
- Some reflections on two current trends in formal argumentation
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Towards a common framework for dialectical proof procedures in abstract argumentation
- Towards fixed-parameter tractable algorithms for abstract argumentation
- Two party immediate response disputes: Properties and efficiency
- Using arguments for making and explaining decisions
- Value-based Argumentation Frameworks as Neural-symbolic Learning Systems
Cited in
(34)- On computing the set of acceptable arguments in abstract argumentation
- On the computation of Top-\(k\) extensions in abstract argumentation frameworks
- Automated Reasoning
- Computation in extended argumentation frameworks
- Taking account of the actions of others in value-based reasoning
- Reduced meet over labelling-based semantics in abstract argumentation
- On the equivalence between logic programming semantics and argumentation semantics
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- How we designed winning algorithms for abstract argumentation and which insight we attained
- Graded labellings for abstract argumentation
- New stochastic local search approaches for computing preferred extensions of abstract argumentation
- Algorithms and complexity results for persuasive argumentation
- Encoding argument graphs in logic
- The first international competition on computational models of argumentation: results and analysis
- Lattice point of view for argumentation framework
- A translation-based approach for revision of argumentation frameworks
- Value-based argumentation framework built from prioritized qualitative choice logic
- On checking skeptical and ideal admissibility in abstract argumentation frameworks
- Intertranslatability of labeling-based argumentation semantics
- Enumeration of preferred extensions in almost oriented digraphs
- Pakota: a system for enforcement in abstract argumentation
- scientific article; zbMATH DE number 1507246 (Why is no real title available?)
- On Decision Problems Related to the Preferred Semantics for Argumentation Frameworks
- Automata, Languages and Programming
- Indepth combinatorial analysis of admissible sets for abstract argumentation
- Looking-ahead in backtracking algorithms for abstract argumentation
- Optimization of dialectical outcomes in dialogical argumentation
- scientific article; zbMATH DE number 1769206 (Why is no real title available?)
- Constrained Value-Based Argumentation Framework
- An abstract argumentation and logic programming comparison based on 5-valued labellings
- Methods for solving reasoning problems in abstract argumentation -- a survey
- The choice-preferred semantics for relevance-oriented acceptance of admissible sets of arguments
- Abstract Argumentation in Dynamic Logic: Representation, Reasoning and Change
- Opposition Frameworks
This page was built for publication: Algorithms for decision problems in argument systems under preferred semantics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490457)
