On incompleteness in abstract argumentation: complexity and expressiveness

DOI10.1007/978-3-031-18843-5_2zbMath1524.68359OpenAlexW4312442861MaRDI QIDQ6163904

Jean-Guy Mailly

Publication date: 26 July 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-18843-5_2

zbMATH Keywords

uncertaintycomputational complexityincomplete knowledgeabstract argumentation

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weighted argument systems: basic definitions, algorithms, and complexity results
• Verification in incomplete argumentation frameworks
• Characteristics of multiple viewpoints in abstract argumentation
• On the merging of Dung's argumentation systems
• A reasoning model based on the production of acceptable arguments
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• Constrained incomplete argumentation frameworks
• Acceptance in incomplete argumentation frameworks
• Abstract argumentation with qualitative uncertainty: an analysis in dynamic logic
• Extension-based semantics for incomplete argumentation frameworks
• Verification in Attack-Incomplete Argumentation Frameworks
• Verification in Argument-Incomplete Argumentation Frameworks
• Handling Ignorance in Argumentation: Semantics of Partial Argumentation Frameworks
• Merging Information Under Constraints: A Logical Framework
• A Generalization of Dung’s Abstract Framework for Argumentation: Arguing with Sets of Attacking Arguments

This page was built for publication: On incompleteness in abstract argumentation: complexity and expressiveness