Details
| Originalsprache | Englisch |
|---|---|
| Titel des Sammelwerks | Proceedings of the 32nd International Joint Conference on Artificial Intelligence, IJCAI 2023 |
| Herausgeber/-innen | Edith Elkind |
| Seiten | 3212-3220 |
| Seitenumfang | 9 |
| ISBN (elektronisch) | 9781956792034 |
| Publikationsstatus | Veröffentlicht - 2023 |
Publikationsreihe
| Name | IJCAI International Joint Conference on Artificial Intelligence |
|---|---|
| Band | 2023-August |
| ISSN (Print) | 1045-0823 |
Abstract
Argumentation is a well-established formalism for nonmonotonic reasoning and a vibrant area of research in AI. Claim-augmented argumentation frameworks (CAFs) have been introduced to deploy a conclusion-oriented perspective. CAFs expand argumentation frameworks by an additional step which involves retaining claims for an accepted set of arguments. We introduce a novel concept of a justification status for claims, a quantitative measure of extensions supporting a particular claim. The well-studied problems of credulous and skeptical reasoning can then be seen as simply the two endpoints of the spectrum when considered as a justification level of a claim. Furthermore, we explore the parameterized complexity of various reasoning problems for CAFs, including the quantitative reasoning for claim assertions. We begin by presenting a suitable graph representation that includes arguments and their associated claims. Our analysis includes the parameter treewidth, and we present decomposition-guided reductions between reasoning problems in CAF and the validity problem for QBF.
Zitieren
- Standard
- Harvard
- Apa
- Vancouver
- BibTex
- RIS
Proceedings of the 32nd International Joint Conference on Artificial Intelligence, IJCAI 2023. Hrsg. / Edith Elkind. 2023. S. 3212-3220 (IJCAI International Joint Conference on Artificial Intelligence; Band 2023-August).
Publikation: Beitrag in Buch/Bericht/Sammelwerk/Konferenzband › Aufsatz in Konferenzband › Forschung › Peer-Review
}
TY - GEN
T1 - Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation.
AU - Fichte, Johannes Klaus
AU - Hecher, Markus
AU - Mahmood, Yasir
AU - Meier, Arne
N1 - Funding Information: Authors are stated in alphabetical order. The work was supported by ELLIIT funded by the Swedish government, by the Austrian Science Fund (FWF) grants J4656, P32830, and Y1329, Society for Research Funding Lower Austria (GFF) grant ExzF-0004, Vienna Science and Technology Fund (WWTF) grants ICT19-060 and ICT19-065, by the European Union’s Horizon Europe research and innovation programme within project ENEXA (101070305), and the German Research Organisation (DFG) project ME4279/3-1 (511769688).
PY - 2023
Y1 - 2023
N2 - Argumentation is a well-established formalism for nonmonotonic reasoning and a vibrant area of research in AI. Claim-augmented argumentation frameworks (CAFs) have been introduced to deploy a conclusion-oriented perspective. CAFs expand argumentation frameworks by an additional step which involves retaining claims for an accepted set of arguments. We introduce a novel concept of a justification status for claims, a quantitative measure of extensions supporting a particular claim. The well-studied problems of credulous and skeptical reasoning can then be seen as simply the two endpoints of the spectrum when considered as a justification level of a claim. Furthermore, we explore the parameterized complexity of various reasoning problems for CAFs, including the quantitative reasoning for claim assertions. We begin by presenting a suitable graph representation that includes arguments and their associated claims. Our analysis includes the parameter treewidth, and we present decomposition-guided reductions between reasoning problems in CAF and the validity problem for QBF.
AB - Argumentation is a well-established formalism for nonmonotonic reasoning and a vibrant area of research in AI. Claim-augmented argumentation frameworks (CAFs) have been introduced to deploy a conclusion-oriented perspective. CAFs expand argumentation frameworks by an additional step which involves retaining claims for an accepted set of arguments. We introduce a novel concept of a justification status for claims, a quantitative measure of extensions supporting a particular claim. The well-studied problems of credulous and skeptical reasoning can then be seen as simply the two endpoints of the spectrum when considered as a justification level of a claim. Furthermore, we explore the parameterized complexity of various reasoning problems for CAFs, including the quantitative reasoning for claim assertions. We begin by presenting a suitable graph representation that includes arguments and their associated claims. Our analysis includes the parameter treewidth, and we present decomposition-guided reductions between reasoning problems in CAF and the validity problem for QBF.
UR - http://www.scopus.com/inward/record.url?scp=85170398884&partnerID=8YFLogxK
U2 - 10.24963/ijcai.2023/358
DO - 10.24963/ijcai.2023/358
M3 - Conference contribution
T3 - IJCAI International Joint Conference on Artificial Intelligence
SP - 3212
EP - 3220
BT - Proceedings of the 32nd International Joint Conference on Artificial Intelligence, IJCAI 2023
A2 - Elkind, Edith
ER -