Computational properties of argument systems satisfying graph-theoretic constraints
type: Item
instance of: scholarly article
title: Computational properties of argument systems satisfying graph-theoretic constraints
zbMATH Open document ID: 1168.68565
author: Paul E. Dunne
published in: Artificial Intelligence
publication date: 2009-07-09T00:00:00Z
Mathematics Subject Classification ID: 68T27
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5576694
zbMATH Keywords: computational properties of argumentation
zbMATH Keywords: argumentation frameworks
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: j.artint.2007.03.006
OpenAlex ID: W2100875224
cites work: A reasoning model based on the production of acceptable arguments
cites work: Complexity of Finding Embeddings in a k-Tree
cites work: Easy problems for tree-decomposable graphs
cites work: Characterization and Recognition of Partial 3-Trees
cites work: Symbolic and Quantitative Approaches to Reasoning with Uncertainty
cites work: SCC-recursiveness: a general schema for argumentation semantics
cites work: Q4399249
cites work: Persuasion in Practical Argument Using Value-based Argumentation Frameworks
cites work: Audiences in argumentation frameworks
cites work: Q3941433
cites work: Q3795218
cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
cites work: A partial k-arboretum of graphs with bounded treewidth
cites work: An abstract, argumentation-theoretic approach to default reasoning
cites work: The relative efficiency of propositional proof systems
cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
cites work: The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
cites work: On the computational complexity of assumption-based argumentation for default reasoning.
cites work: Graph theoretical structures in logic programs and default theories
cites work: Fixed-Parameter Tractability and Completeness I: Basic Results
cites work: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
cites work: Dialectic proof procedures for assumption-based, admissible argumentation
cites work: Q3994882
cites work: Coherence in finite argument systems.
cites work: Two party immediate response disputes: Properties and efficiency
cites work: Logics in Artificial Intelligence
cites work: Planar kernel and Grundy with \(d\leq 3\), \(dout\leq 2\), \(din\leq 2\) are NP- complete
cites work: Q4198056
cites work: Fixed-parameter complexity in AI and nonmonotonic reasoning
cites work: Q4148000
cites work: A Separator Theorem for Planar Graphs
cites work: Planar Crossovers
cites work: Q3221403
cites work: Graph minors. II. Algorithmic aspects of tree-width
cites work: Theory and Applications of Satisfiability Testing
cites work: The Complexity of Propositional Proofs
cites work: Q4536329
DOI: 10.1016/J.ARTINT.2007.03.006
Recommended article: Graph theoretical properties of logic based argumentation frameworks: proofs and general results
Recommended article: Argument graphs and assumption-based argumentation
Recommended article: Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach
Recommended article: Structural Properties for Deductive Argument Systems
Recommended article: Computation in Extended Argumentation Frameworks
Recommended article: Q5116415
Recommended article: Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks
Recommended article: Declarative Algorithms and Complexity Results for Assumption-Based Argumentation
description: scientific article; zbMATH DE number 5576694