Simple Contrapositive Assumption-Based Argumentation with Partially-Ordered Preferences

Ofer Arieli; Jesse Heyninck

doi:10.24963/kr.2023/6

Simple Contrapositive Assumption-Based Argumentation with Partially-Ordered Preferences

^*Corresponding author for this work

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

Abstract

We show that assumption-based argumentation frameworks, based on contrapositive logics and partially-ordered preference functions, provide a solid platform for argumentation-based reasoning. Two useful properties of the preference functions are identified (selectivity and max-lower-boundedness), and extended forms of attacks relations are supported (exists-attacks and forall-attacks), which assure several desirable properties and a variety of reasoning modes.

Original language	English
Title of host publication	Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning
Editors	Pierre Marquis, Tran Cao Son, Gabriele Kern-Isberner
Publisher	IJCAI Organization
Pages	55-64
Number of pages	10
ISBN (Electronic)	9781956792027
ISBN (Print)	978-1-956792-02-7
DOIs	https://doi.org/10.24963/kr.2023/6
Publication status	Published - Sept 2023
Event	20th International Conference on Principles of Knowledge Representation and Reasoning: KR2023 - Rhodes, Greece Duration: 2 Sept 2023 → 8 Sept 2023 https://kr.org/KR2023/

Conference

Conference	20th International Conference on Principles of Knowledge Representation and Reasoning
Country/Territory	Greece
City	Rhodes
Period	2/09/23 → 8/09/23
Internet address	https://kr.org/KR2023/

Access to Document

10.24963/kr.2023/6Licence: Free by publisher

Cite this

@inproceedings{de26dd11b7874d998c64d3ae83c33632,

title = "Simple Contrapositive Assumption-Based Argumentation with Partially-Ordered Preferences",

abstract = "We show that assumption-based argumentation frameworks, based on contrapositive logics and partially-ordered preference functions, provide a solid platform for argumentation-based reasoning. Two useful properties of the preference functions are identified (selectivity and max-lower-boundedness), and extended forms of attacks relations are supported (exists-attacks and forall-attacks), which assure several desirable properties and a variety of reasoning modes.",

author = "Ofer Arieli and Jesse Heyninck",

year = "2023",

month = sep,

doi = "10.24963/kr.2023/6",

language = "English",

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

pages = "55--64",

editor = "Pierre Marquis and \{Cao Son\}, Tran and Gabriele Kern-Isberner",

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

publisher = "IJCAI Organization",

address = "United States",

note = "20th International Conference on Principles of Knowledge Representation and Reasoning : KR2023 ; Conference date: 02-09-2023 Through 08-09-2023",

url = "https://kr.org/KR2023/",

}

Arieli, O & Heyninck, J 2023, Simple Contrapositive Assumption-Based Argumentation with Partially-Ordered Preferences. in P Marquis, T Cao Son & G Kern-Isberner (eds), Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning. IJCAI Organization, pp. 55-64, 20th International Conference on Principles of Knowledge Representation and Reasoning, Rhodes, Greece, 2/09/23. https://doi.org/10.24963/kr.2023/6

Simple Contrapositive Assumption-Based Argumentation with Partially-Ordered Preferences. / Arieli, Ofer; Heyninck, Jesse.
Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning. ed. / Pierre Marquis; Tran Cao Son; Gabriele Kern-Isberner. IJCAI Organization, 2023. p. 55-64.

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

TY - GEN

T1 - Simple Contrapositive Assumption-Based Argumentation with Partially-Ordered Preferences

AU - Arieli, Ofer

AU - Heyninck, Jesse

PY - 2023/9

Y1 - 2023/9

N2 - We show that assumption-based argumentation frameworks, based on contrapositive logics and partially-ordered preference functions, provide a solid platform for argumentation-based reasoning. Two useful properties of the preference functions are identified (selectivity and max-lower-boundedness), and extended forms of attacks relations are supported (exists-attacks and forall-attacks), which assure several desirable properties and a variety of reasoning modes.

AB - We show that assumption-based argumentation frameworks, based on contrapositive logics and partially-ordered preference functions, provide a solid platform for argumentation-based reasoning. Two useful properties of the preference functions are identified (selectivity and max-lower-boundedness), and extended forms of attacks relations are supported (exists-attacks and forall-attacks), which assure several desirable properties and a variety of reasoning modes.

U2 - 10.24963/kr.2023/6

DO - 10.24963/kr.2023/6

M3 - Conference Article in proceeding

SN - 978-1-956792-02-7

SP - 55

EP - 64

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

A2 - Marquis, Pierre

A2 - Cao Son, Tran

A2 - Kern-Isberner, Gabriele

PB - IJCAI Organization

T2 - 20th International Conference on Principles of Knowledge Representation and Reasoning

Y2 - 2 September 2023 through 8 September 2023

ER -

Simple Contrapositive Assumption-Based Argumentation with Partially-Ordered Preferences

Abstract

Conference

Access to Document

Fingerprint

Cite this