Abstract argumentation via monadic second order logic

Authors:
Wolfgang Dvořák;Stefan Szeider;Stefan Woltran
Affiliations:
Theory and Applications of Algorithms Group, University of Vienna, Austria;Institute of Information Systems, Vienna University of Technology, Austria;Institute of Information Systems, Vienna University of Technology, Austria
Venue:
SUM'12 Proceedings of the 6th international conference on Scalable Uncertainty Management
Year:
2012

Citing 22
Cited 1

Easy problems for tree-decomposable graphs

Journal of Algorithms
Graph rewriting: an algebraic and logic approach

Handbook of theoretical computer science (vol. B)
On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games

Artificial Intelligence
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

SIAM Journal on Computing
On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic

Discrete Applied Mathematics - Special issue on international workshop of graph-theoretic concepts in computer science WG'98 conference selected papers
Context-free Handle-rewriting Hypergraph Grammars

Proceedings of the 4th International Workshop on Graph-Grammars and Their Application to Computer Science
Approximating clique-width and branch-width

Journal of Combinatorial Theory Series B
Argumentation in artificial intelligence

Artificial Intelligence
Computational properties of argument systems satisfying graph-theoretic constraints

Artificial Intelligence
Reasoning in Argumentation Frameworks Using Quantified Boolean Formulas

Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006
SCC-recursiveness: a general schema for argumentation semantics

Artificial Intelligence
Bounded treewidth as a key to tractability of knowledge representation and reasoning

Artificial Intelligence
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
cf2 Semantics Revisited

Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010
On the resolution-based family of abstract argumentation semantics and its grounded instance

Artificial Intelligence
Finding partitions of arguments with Dung's properties via SCSPs

Proceedings of the 2011 ACM Symposium on Applied Computing
Argumentation and answer set programming

Logic programming, knowledge representation, and nonmonotonic reasoning
Discovering theorems in game theory: Two-person games with unique pure Nash equilibrium payoffs

Artificial Intelligence
Argumentation frameworks as constraint satisfaction problems

SUM'11 Proceedings of the 5th international conference on Scalable uncertainty management
Towards fixed-parameter tractable algorithms for abstract argumentation

Artificial Intelligence
Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems

The Computer Journal

Structural properties for deductive argument systems

ECSQARU'13 Proceedings of the 12th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose the formalism of Monadic Second Order Logic (MSO) as a unifying framework for representing and reasoning with various semantics of abstract argumentation. We express a wide range of semantics within the proposed framework, including the standard semantics due to Dung, semi-stable, stage, cf2, and resolution-based semantics. We provide building blocks which make it easy and straight-forward to express further semantics and reasoning tasks. Our results show that MSO can serve as a lingua franca for abstract argumentation that directly yields to complexity results. In particular, we obtain that for argumentation frameworks with certain structural properties the main computational problems with respect to MSO-expressible semantics can all be solved in linear time. Furthermore, we provide a novel characterization of resolution-based grounded semantics.