Graph theoretical structures in logic programs and default theories
Theoretical Computer Science
An abstract, argumentation-theoretic approach to default reasoning
Artificial Intelligence
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Reasoning Model Based on the Production of Acceptable Arguments
Annals of Mathematics and Artificial Intelligence
On the computational complexity of assumption-based argumentation for default reasoning
Artificial Intelligence
Coherence in finite argument systems
Artificial Intelligence
Two party immediate response disputes: properties and efficiency
Artificial Intelligence
Graphs and Hypergraphs
SCC-recursiveness: a general schema for argumentation semantics
Artificial Intelligence
Symmetric argumentation frameworks
ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Computational properties of argument systems satisfying graph-theoretic constraints
Artificial Intelligence
Hi-index | 0.00 |
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been classified as complete for classes such as NP, CO-NP, and Πp2. In consequence, a number of researchers have considered methods for specialising the structure of such systems so as to identify classes for which efficient decision processes exist. In this paper the effect of a number of graph-theoretic restrictions is considered. For the class of bipartite graphs, it is shown that determining the acceptability status of a specific argument can be accomplished in polynomial time under both credulous and sceptical semantics. In contrast to these positive results, however, deciding whether an arbitrary set of arguments is “collectively acceptable” remains NP--complete in bipartite systems. In addition, a construction is presented by means of which questions posed of arguments in any given finite argument system may be expressed as questions within a related system in which every argument attacks and is attacked by at most two arguments. It follows that bounding the number of attacks on individual arguments is unlikely to produce a computationally more tractable environment.