The complexity of Boolean networks
The complexity of Boolean networks
Discrete Mathematics
Default reasoning using classical logic
Artificial Intelligence
Graph theoretical structures in logic programs and default theories
Theoretical Computer Science
An abstract, argumentation-theoretic approach to default reasoning
Artificial Intelligence
Dialectic semantics for argumentation frameworks
ICAIL '99 Proceedings of the 7th international conference on Artificial intelligence and law
Preferred Arguments are Harder to Compute than Stable Extension
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Two party immediate response disputes: properties and efficiency
Artificial Intelligence
Dialectic proof procedures for assumption-based, admissible argumentation
Artificial Intelligence
Audiences in argumentation frameworks
Artificial Intelligence
Argumentation in artificial intelligence
Artificial Intelligence
On the merging of Dung's argumentation systems
Artificial Intelligence
Computational properties of argument systems satisfying graph-theoretic constraints
Artificial Intelligence
Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Handling Ignorance in Argumentation: Semantics of Partial Argumentation Frameworks
ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Towards an Extensible Argumentation System
ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
A review of current defeasible reasoning implementations
The Knowledge Engineering Review
Computing Argumentation Semantics in Answer Set Programming
New Frontiers in Artificial Intelligence
Inconsistency tolerance in weighted argument systems
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Complexity Properties of Restricted Abstract Argument Systems
Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006
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
Reasoning in Argumentation Frameworks Using Quantified Boolean Formulas
Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006
Asking the Right Question: Forcing Commitment in Examination Dialogues
Proceedings of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008
The Computational Complexity of Ideal Semantics I: Abstract Argumentation Frameworks
Proceedings of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008
Theoretical and Computational Properties of Preference-based Argumentation
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Case law in extended argumentation frameworks
Proceedings of the 12th International Conference on Artificial Intelligence and Law
Expressing Extension-Based Semantics Based on Stratified Minimal Models
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Encoding deductive argumentation in quantified Boolean formulae
Artificial Intelligence
Argumentation Context Systems: A Framework for Abstract Group Argumentation
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Journal of Artificial Intelligence Research
A labeling approach to the computation of credulous acceptance in argumentation
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Dialectic proof procedures for assumption-based, admissible argumentation
Artificial Intelligence
The computational complexity of ideal semantics
Artificial Intelligence
Computational properties of resolution-based grounded semantics
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Modular argumentation for modelling legal doctrines in common law of contract
Artificial Intelligence and Law
Complexity of semi-stable and stage semantics in argumentation frameworks
Information Processing Letters
Reasoning in Argumentation Frameworks of Bounded Clique-Width
Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010
Change in abstract argumentation frameworks: adding an argument
Journal of Artificial Intelligence Research
Weighted argument systems: Basic definitions, algorithms, and complexity results
Artificial Intelligence
On the resolution-based family of abstract argumentation semantics and its grounded instance
Artificial Intelligence
A computational method for defeasible argumentation based on a recursive warrant semantics
IBERAMIA'10 Proceedings of the 12th Ibero-American conference on Advances in artificial intelligence
On the intertranslatability of argumentation semantics
Journal of Artificial Intelligence Research
Determining preferences through argumentation
AI*IA'05 Proceedings of the 9th conference on Advances in Artificial Intelligence
Inference from controversial arguments
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
On the complexity of paraconsistent inference relations
Inconsistency Tolerance
Symmetric argumentation frameworks
ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Enhancing dung's preferred semantics
FoIKS'10 Proceedings of the 6th international conference on Foundations of Information and Knowledge Systems
Augmenting tractable fragments of abstract argumentation
Artificial Intelligence
Towards fixed-parameter tractable algorithms for abstract argumentation
Artificial Intelligence
On the complexity of computing the justification status of an argument
TAFA'11 Proceedings of the First international conference on Theory and Applications of Formal Argumentation
Parametric properties of ideal semantics
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Augmenting tractable fragments of abstract argumentation
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
The Multivariate Algorithmic Revolution and Beyond
Minimal hypotheses: extension-based semantics to argumentation
Annals of Mathematics and Artificial Intelligence
A semantics for dynamic argumentation frameworks
ArgMAS'11 Proceedings of the 8th international conference on Argumentation in Multi-Agent Systems
Modelling argument accrual with possibilistic uncertainty in a logic programming setting
Information Sciences: an International Journal
Automata for infinite argumentation structures
Artificial Intelligence
Complexity-sensitive decision procedures for abstract argumentation
Artificial Intelligence
Hi-index | 0.00 |
Argument Systems provide a rich abstraction within which divers concepts of reasoning, acceptability and defeasibility of arguments, etc., may be studied using a unified framework. Two important concepts of the acceptability of an argument p in such systems are credulous acceptance to capture the notion that p can be 'believed'; and sceptical acceptance capturing the idea that if anything is believed, then p must be. One important aspect affecting the computational complexity of these problems concerns whether the admissibility of an argument is defined with respect to 'preferred' or 'stable' semantics. One benefit of so-called 'coherent' argument systems being that the preferred extensions coincide with stable extensions. In this note we consider complexity-theoretic issues regarding deciding if finitely presented argument systems modelled as directed graphs are coherent. Our main result shows that the related decision problem is Π(p)2 -complete and is obtained solely via the graph-theoretic representation of an argument system, thus independent of the specific logic underpinning the reasoning theory.