The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
Easy problems for tree-decomposable graphs
Journal of Algorithms
Monadic second-order evaluations on tree-decomposable graphs
Theoretical Computer Science - Special issue on selected papers of the International Workshop on Computing by Graph Transformation, Bordeaux, France, March 21–23, 1991
The pleadings game: formalizing procedural justice
ICAIL '93 Proceedings of the 4th international conference on Artificial intelligence and law
Dialectic semantics for argumentation frameworks
ICAIL '99 Proceedings of the 7th international conference on Artificial intelligence and law
A Reasoning Model Based on the Production of Acceptable Arguments
Annals of Mathematics and Artificial Intelligence
Credulous and Sceptical Argument Games for Preferred Semantics
JELIA '00 Proceedings of the European Workshop on Logics in Artificial Intelligence
Preferred Extensions of Argumentation Frameworks: Query Answering and Computation
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Two party immediate response disputes: properties and efficiency
Artificial Intelligence
Value-based Argumentation Frameworks as Neural-symbolic Learning Systems
Journal of Logic and Computation
Audiences in argumentation frameworks
Artificial Intelligence
Argumentation in artificial intelligence
Artificial Intelligence
Computing ideal sceptical argumentation
Artificial Intelligence
Computational properties of argument systems satisfying graph-theoretic constraints
Artificial Intelligence
Argument based machine learning
Artificial Intelligence
Elements of Argumentation
Preferred extensions as stable models*
Theory and Practice of Logic Programming
An Algorithm for Computing Semi-stable Semantics
ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Using arguments for making and explaining decisions
Artificial Intelligence
ASPARTIX: Implementing Argumentation Frameworks Using Answer-Set Programming
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Reasoning about preferences in argumentation frameworks
Artificial Intelligence
An algorithm to compute minimally grounded and admissible defence sets in argument systems
Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006
Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006
Argumentation in Artificial Intelligence
Argumentation in Artificial Intelligence
A labeling approach to the computation of credulous acceptance in argumentation
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Labellings and games for extended argumentation frameworks
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
An Algorithm for Stage Semantics
Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010
Tractability in Value-based Argumentation
Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010
AFRA: Argumentation framework with recursive attacks
International Journal of Approximate Reasoning
Algorithms and complexity results for persuasive argumentation
Artificial Intelligence
Dynamics of argumentation systems: A division-based method
Artificial Intelligence
Argumentation frameworks as constraint satisfaction problems
SUM'11 Proceedings of the 5th international conference on Scalable uncertainty management
Journal of Logic and Computation
Review: an introduction to argumentation semantics
The Knowledge Engineering Review
Towards fixed-parameter tractable algorithms for abstract argumentation
Artificial Intelligence
Probabilistic argumentation frameworks
TAFA'11 Proceedings of the First international conference on Theory and Applications of Formal Argumentation
Splitting argumentation frameworks: an empirical evaluation
TAFA'11 Proceedings of the First international conference on Theory and Applications of Formal Argumentation
Conditional labelling for abstract argumentation
TAFA'11 Proceedings of the First international conference on Theory and Applications of Formal Argumentation
Augmenting tractable fragments of abstract argumentation
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Some reflections on two current trends in formal argumentation
Logic Programs, Norms and Action
Hi-index | 0.00 |
For Dung@?s model of abstract argumentation under preferred semantics, argumentation frameworks may have several distinct preferred extensions: i.e., in informal terms, sets of acceptable arguments. Thus the acceptance problem (for a specific argument) can consider deciding whether an argument is in at least one such extensions (credulously accepted) or in all such extensions (skeptically accepted). We start by presenting a new algorithm that enumerates all preferred extensions. Following this we build algorithms that decide the acceptance problem without requiring explicit enumeration of all extensions. We analyze the performance of our algorithms by comparing these to existing ones, and present experimental evidence that the new algorithms are more efficient with respect to the expected running time. Moreover, we extend our techniques to solve decision problems in a widely studied development of Dung@?s model: namely value-based argumentation frameworks (vafs). In this regard, we examine analogous notions to the problem of enumerating preferred extensions and present algorithms that decide subjective, respectively objective, acceptance.