A general QBF-based formalization of abstract argumentation theory

Arieli, Ofer and Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238 2012. A general QBF-based formalization of abstract argumentation theory. Verheij, B., Szeider, S. and Woltran, S., eds. Computational Models of Argument, Frontiers in Artificial Intelligence and Applications, vol. 245. IOS Press, pp. 105-116. (10.3233/978-1-61499-111-3-105)

Full text not available from this repository.

Abstract

We introduce a unified logical approach, based on signed theories and Quantified Boolean Formulas (QBFs), that can serve as a basis for representing and reasoning with various argumentation-based decision problems. By this, we are able to represent, in a uniform and simple way, a wide range of extension-based semantics for argumentation theory, including complete, grounded, preferred, semi-stable, stage, ideal and eager semantics. Furthermore, our approach involves only propositional languages and quantifications over propositional variables, making decision problems like skeptical and credulous acceptance of arguments simply a matter of logical entailment and satisfiability, which can be verified by existing QBF-solvers.

Item Type:	Book Section
Date Type:	Publication
Status:	Published
Schools:	Computer Science & Informatics
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Publisher:	IOS Press
ISBN:	978-1614991106
Last Modified:	31 Oct 2022 10:17
URI:	https://orca.cardiff.ac.uk/id/eprint/84280

Citation Data

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

Actions (repository staff only)

Edit Item