A QBF-based Formalization of Abstract Argumentation Semantics

Ofer Arieli, Martin W.A. Caminada

Research output: Contribution to journalArticle

24 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

Semantics

Keywords

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

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

A QBF-based Formalization of Abstract Argumentation Semantics. / Arieli, Ofer; Caminada, Martin W.A.

In: Journal of Applied Logic, Vol. 11, No. 2, 06.2013, p. 229-252.

Research output: Contribution to journalArticle

Arieli, Ofer ; Caminada, Martin W.A. / A QBF-based Formalization of Abstract Argumentation Semantics. In: Journal of Applied Logic. 2013 ; Vol. 11, No. 2. pp. 229-252.
@article{d461f9cc14164fb2bad2df65724c7c40,
title = "A QBF-based Formalization of Abstract Argumentation Semantics",
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.",
keywords = "semantics for abstract argumentation, frameworks, quantified Boolean formulas, signed theories",
author = "Ofer Arieli and Caminada, {Martin W.A.}",
note = "Supported by the National Research Fund, Luxembourg (LAAMI project) and by the Engineering and Physical Sciences Research Council (EPSRC, UK), grant ref. EP/J012084/1 (SAsSY project).",
year = "2013",
month = "6",
doi = "10.1016/j.jal.2013.03.009",
language = "English",
volume = "11",
pages = "229--252",
journal = "Journal of Applied Logic",
number = "2",

}

TY - JOUR

T1 - A QBF-based Formalization of Abstract Argumentation Semantics

AU - Arieli, Ofer

AU - Caminada, Martin W.A.

N1 - Supported by the National Research Fund, Luxembourg (LAAMI project) and by the Engineering and Physical Sciences Research Council (EPSRC, UK), grant ref. EP/J012084/1 (SAsSY project).

PY - 2013/6

Y1 - 2013/6

N2 - 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.

AB - 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.

KW - semantics for abstract argumentation

KW - frameworks

KW - quantified Boolean formulas

KW - signed theories

U2 - 10.1016/j.jal.2013.03.009

DO - 10.1016/j.jal.2013.03.009

M3 - Article

VL - 11

SP - 229

EP - 252

JO - Journal of Applied Logic

JF - Journal of Applied Logic

IS - 2

ER -