A QBF-based formalization of abstract argumentation semantics |
| |
Authors: | Ofer Arieli Martin W.A. Caminada |
| |
Affiliation: | 1. School of Computer Science, The Academic College of Tel-Aviv, Tel-Aviv, Israel;2. Interdisciplinary Centre for Security, Reliability and Trust, University of Luxembourg, Luxembourg;3. Department of Computing Science, University of Aberdeen, United Kingdom |
| |
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. |
| |
Keywords: | Semantics for abstract argumentation frameworks Quantified Boolean formulas Signed theories |
本文献已被 ScienceDirect 等数据库收录! |
|