A QBF-based formalization of abstract argumentation semantics

Arieli, Ofer and Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238 2013. A QBF-based formalization of abstract argumentation semantics. Journal of Applied Logic 11 (2) , pp. 229-252. 10.1016/j.jal.2013.03.009

Full text not available from this repository.

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.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Computer Science & Informatics
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
ISSN:	1570-8683
Last Modified:	31 Oct 2022 10:17
URI:	https://orca.cardiff.ac.uk/id/eprint/84278

Citation Data

Cited 32 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item