Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4663046 | Journal of Applied Logic | 2013 | 24 Pages |
Abstract
We introduce a unified logical theory, based on signed theories and Quantified Boolean Formulas (QBFs) that can serve as the basis for representing and computing various argumentation-based decision problems. It is shown that within our framework we are able to model, in a simple and modular way, a wide range of semantics for abstract argumentation theory. This includes complete, grounded, preferred, stable, semi-stable, stage, ideal and eager semantics. Furthermore, our approach is purely logical, making for instance decision problems like skeptical and credulous acceptance of arguments simply a matter of entailment and satisfiability checking. The latter may be verified by off-the-shelf QBF-solvers.
Related Topics
Physical Sciences and Engineering
Mathematics
Logic
Authors
Ofer Arieli, Martin W.A. Caminada,