Verification in incomplete argumentation frameworks

DOI10.1016/J.ARTINT.2018.08.001zbMath1478.68343OpenAlexW2885218246MaRDI QIDQ668774

Hilmar Schadrack, Daniel Neugebauer, Jörg Rothe, Dorothea Baumeister

Publication date: 19 March 2019

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2018.08.001

zbMATH Keywords

verificationcomputational complexityincomplete knowledgeabstract argumentationargumentation framework

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Related Items (16)

The possible winner problem with uncertain weights revisited ⋮ Constrained incomplete argumentation frameworks ⋮ Complexity of nonemptiness in control argumentation frameworks ⋮ Explainable acceptance in probabilistic and incomplete abstract argumentation frameworks ⋮ The possible winner with uncertain weights problem ⋮ Probabilistic causal bipolar abstract argumentation: an approach based on credal networks ⋮ Dynamic epistemic logics for abstract argumentation ⋮ Taking into account ``who said what in abstract argumentation: complexity results ⋮ On incompleteness in abstract argumentation: complexity and expressiveness ⋮ Theoretical analysis and implementation of abstract argumentation frameworks with domain assignments ⋮ Abstract argumentation with qualitative uncertainty: an analysis in dynamic logic ⋮ Integrating individual preferences into collective argumentation ⋮ Extension-based semantics for incomplete argumentation frameworks ⋮ Verification in incomplete argumentation frameworks ⋮ Acceptance in incomplete argumentation frameworks ⋮ On dynamics in structured argumentation formalisms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New candidates welcome! Possible winners with respect to the addition of new candidates
• Dynamics of argumentation systems: a division-based method
• Verification in incomplete argumentation frameworks
• Graph theoretical structures in logic programs and default theories
• Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules
• Argumentation in artificial intelligence
• On the merging of Dung's argumentation systems
• The polynomial-time hierarchy
• The first international competition on computational models of argumentation: results and analysis
• Coherence in finite argument systems.
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• Probabilistic qualification of attack in abstract argumentation
• SCC-recursiveness: a general schema for argumentation semantics
• Complexity theory and cryptology. An introduction to cryptocomplexity.
• Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods
• Determining Possible and Necessary Winners Given Partial Orders
• Verification in Attack-Incomplete Argumentation Frameworks
• Verification in Argument-Incomplete Argumentation Frameworks
• Handling Ignorance in Argumentation: Semantics of Partial Argumentation Frameworks
• Change in Abstract Argumentation Frameworks: Adding an Argument
• Dynamics in Argumentation with Single Extensions: Abstraction Principles and the Grounded Extension
• Complexity Results and Algorithms for Extension Enforcement in Abstract Argumentation
• Aggregation of Attack Relations: A Social-Choice Theoretical Analysis of Defeasibility Criteria
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty

This page was built for publication: Verification in incomplete argumentation frameworks