A QBF-based Formalization of Abstract Argumentation Semantics

Ofer Arieli, Martin W.A. Caminada

Research output: Contribution to journalArticle

25 Citations (Scopus)
4 Downloads (Pure)

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. Further more, 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.
Original languageEnglish
Pages (from-to)229-252
Number of pages24
JournalJournal of Applied Logic
Volume11
Issue number2
Early online date21 Mar 2013
DOIs
Publication statusPublished - Jun 2013

    Fingerprint

Keywords

  • semantics for abstract argumentation
  • frameworks
  • quantified Boolean formulas
  • signed theories

ASJC Scopus subject areas

  • Computer Science(all)

Cite this