Formulating Semantics of Probabilistic Argumentation by Characterizing Subgraphs

DOI10.1007/978-3-662-48561-3_20zbMath1471.68273OpenAlexW2293856750MaRDI QIDQ3457708

Beishui Liao, Huaxin Huang

Publication date: 17 December 2015

Published in: Logic, Rationality, and Interaction (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48561-3_20

zbMATH Keywords

computational complexitycomputational efficiencysemanticsprobabilistic argumentationcharacterized subgraphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Probability and inductive logic (03B48)

Related Items (1)

A labelling framework for probabilistic argumentation

Cites Work

• Weighted argument systems: basic definitions, algorithms, and complexity results
• On principle-based evaluation of extension-based argumentation semantics
• 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
• Probabilistic Abstract Dialectical Frameworks
• On the Complexity of Probabilistic Abstract Argumentation Frameworks

This page was built for publication: Formulating Semantics of Probabilistic Argumentation by Characterizing Subgraphs