On incompleteness in abstract argumentation: complexity and expressiveness

DOI10.1007/978-3-031-18843-5_2MaRDI QIDQ6163904zbMATH OpenOpenAlexFDO

Authors 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

abstract argumentationcomputational complexityincomplete knowledgeuncertainty

Mathematics Subject Classification ID

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

Recommendations

• Extension-based semantics for incomplete argumentation frameworks: properties, complexity and algorithms
• Extension-based semantics for incomplete argumentation frameworks
• I don't care, I don't know \(\dots \) I know too much! on incompleteness and undecidedness in abstract argumentation
• Constrained incomplete argumentation frameworks
• Complexity of Possible and Necessary Existence Problems in Abstract Argumentation

Cites work

• A Generalization of Dung’s Abstract Framework for Argumentation: Arguing with Sets of Attacking Arguments
• A reasoning model based on the production of acceptable arguments
• Abstract argumentation with qualitative uncertainty: an analysis in dynamic logic
• Acceptance in incomplete argumentation frameworks
• Characteristics of multiple viewpoints in abstract argumentation
• Constrained incomplete argumentation frameworks
• Credulous and skeptical acceptance in incomplete argumentation frameworks
• Extension-based semantics for incomplete argumentation frameworks
• Handling Ignorance in Argumentation: Semantics of Partial Argumentation Frameworks
• scientific article; zbMATH DE number 140403 (Why is no real title available?)
• scientific article; zbMATH DE number 1946853 (Why is no real title available?)
• scientific article; zbMATH DE number 6934384 (Why is no real title available?)
• Merging Information Under Constraints: A Logical Framework
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
• On the merging of Dung's argumentation systems
• Possible controllability of control argumentation frameworks
• Verification in argument-incomplete argumentation frameworks
• Verification in attack-incomplete argumentation frameworks
• Verification in incomplete argumentation frameworks
• Weighted argument systems: basic definitions, algorithms, and complexity results

Cited in

(7)

• Constrained incomplete argumentation frameworks
• Complexity of nonemptiness in control argumentation frameworks
• Towards a general theory of decomposability in abstract argumentation
• Complexity-sensitive decision procedures for abstract argumentation
• Complexity of Possible and Necessary Existence Problems in Abstract Argumentation
• Extension-based semantics for incomplete argumentation frameworks: properties, complexity and algorithms
• Extension-based semantics for incomplete argumentation frameworks: grounded semantics and principles

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6163904)