Enforcing Sets of Formulas in Structured Argumentation.

AnneMarie Borg; Floris Bex

doi:10.24963/kr.2021/13

Enforcing Sets of Formulas in Structured Argumentation.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

Abstract

Enforcement, adjusting an argumentation framework such that a certain set of arguments becomes acceptable, is an important research topic within the study of dynamic argumentation, but one that has been little studied for structured argumentation. In this paper we study enforcement in a general structured argumentation setting. In particular, we study conditions on the argumentation setting and the knowledge base that ensure (or prevent) the acceptability of sets of formulas for structured argumentation frameworks.

Original language	English
Title of host publication	Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning
Editors	Meghyn Bienvenu, Gerhard Lakemeyer, Esra Erdem
Publisher	International Joint Conferences on Artificial Intelligence Organization
Pages	130-140
Number of pages	11
ISBN (Print)	978-1-956792-99-7
DOIs	https://doi.org/10.24963/kr.2021/13
Publication status	Published - 1 Sept 2021

Bibliographical note

DBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.

Keywords

Argumentation

Access to Document

10.24963/kr.2021/13

kr2021-0013-borg-et-alFinal published version, 225 KBLicence: Taverne

Cite this

@inproceedings{91611bb7db0f412cbeeebc8978870b01,

title = "Enforcing Sets of Formulas in Structured Argumentation.",

abstract = "Enforcement, adjusting an argumentation framework such that a certain set of arguments becomes acceptable, is an important research topic within the study of dynamic argumentation, but one that has been little studied for structured argumentation. In this paper we study enforcement in a general structured argumentation setting. In particular, we study conditions on the argumentation setting and the knowledge base that ensure (or prevent) the acceptability of sets of formulas for structured argumentation frameworks.",

keywords = "Argumentation",

author = "AnneMarie Borg and Floris Bex",

note = "DBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.",

year = "2021",

month = sep,

day = "1",

doi = "10.24963/kr.2021/13",

language = "English",

isbn = "978-1-956792-99-7",

pages = "130--140",

editor = "Meghyn Bienvenu and Gerhard Lakemeyer and Esra Erdem",

booktitle = "Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning",

publisher = "International Joint Conferences on Artificial Intelligence Organization",

}

Enforcing Sets of Formulas in Structured Argumentation. / Borg, AnneMarie ; Bex, Floris.
Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning. ed. / Meghyn Bienvenu; Gerhard Lakemeyer; Esra Erdem. International Joint Conferences on Artificial Intelligence Organization, 2021. p. 130-140.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Enforcing Sets of Formulas in Structured Argumentation.

AU - Borg, AnneMarie

AU - Bex, Floris

N1 - DBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.

PY - 2021/9/1

Y1 - 2021/9/1

N2 - Enforcement, adjusting an argumentation framework such that a certain set of arguments becomes acceptable, is an important research topic within the study of dynamic argumentation, but one that has been little studied for structured argumentation. In this paper we study enforcement in a general structured argumentation setting. In particular, we study conditions on the argumentation setting and the knowledge base that ensure (or prevent) the acceptability of sets of formulas for structured argumentation frameworks.

AB - Enforcement, adjusting an argumentation framework such that a certain set of arguments becomes acceptable, is an important research topic within the study of dynamic argumentation, but one that has been little studied for structured argumentation. In this paper we study enforcement in a general structured argumentation setting. In particular, we study conditions on the argumentation setting and the knowledge base that ensure (or prevent) the acceptability of sets of formulas for structured argumentation frameworks.

KW - Argumentation

U2 - 10.24963/kr.2021/13

DO - 10.24963/kr.2021/13

M3 - Conference contribution

SN - 978-1-956792-99-7

SP - 130

EP - 140

BT - Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning

A2 - Bienvenu, Meghyn

A2 - Lakemeyer, Gerhard

A2 - Erdem, Esra

PB - International Joint Conferences on Artificial Intelligence Organization

ER -

Enforcing Sets of Formulas in Structured Argumentation.

Abstract

Bibliographical note

Keywords

Access to Document

Fingerprint

Cite this