Record link: 
http://hdl.handle.net/20.500.12708/203803
-
Title: 
A Nonmonotonic Proof Theory for Dialectical Argumentation Under Bounded Resources
en
Citation: 
van Berkel, K., & Modgil, S. (2024). A Nonmonotonic Proof Theory for Dialectical Argumentation Under Bounded Resources. In Computational Models of Argument: Proceedings of COMMA 2024 (pp. 301–312). IOS Press. https://doi.org/10.3233/FAIA240330
-
CatalogPlus: 
AC17346640
-
Publisher DOI: 
10.3233/FAIA240330
-
Publication Type: 
Inproceedings - Full-Paper Contribution
en
Language: 
English
-
Authors: 
van Berkel, Kees 
Modgil, Sanjay 
-
Organisational Unit: 
E192-05 - Forschungsbereich Theory and Logic 
-
Published in: 
Computational Models of Argument: Proceedings of COMMA 2024 
-
ISBN: 
9781643685359
-
Volume: 
388
-
Date (published): 
2024
-
Event name: 
Computational Models of Argument (COMMA 2024) 
en
Event date: 
18-Sep-2024 - 20-Sep-2024
-
Event place: 
Hagen, Germany
-
Number of Pages: 
12
-
Publisher: 
IOS Press
-
Peer reviewed: 
Yes
-
Keywords: 
dialectical argumentation; logical argumentation; proof theory
en
Project title: 
Molekulare Oekologie von Trichoderma in europaeischen Waldboeden: P17895-B06 (FWF - Österr. Wissenschaftsfonds) 
-
Research Areas: 
Computer Science Foundations: 100%
-
Science Branch: 
1020 - Informatik: 80%
1010 - Mathematik: 20%
-
License: 
CC BY-NC 4.0 CC BY-NC 4.0
en
Appears in Collections:
Conference Paper

Thumbnail
Fulltext (Version of Record (published version))
Adobe PDF
(334.55 kB)
Artikel
Open Access CC BY-NC 4.0
Show full item record

Page view(s)

217
checked on Oct 30, 2024

Download(s)

209
checked on Oct 30, 2024

Google ScholarTM

Check