On probabilistic argumentation and subargument-completeness

DOI10.1093/LOGCOM/EXAB053MaRDI QIDQ5028305zbMATH OpenOpenAlexFDO

Authors Régis Riveret, Nir Oren

Publication date 8 February 2022

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/logcom/exab053

zbMATH Keywords

abstract argumentationlabelling semanticsprobabilistic argumentation

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Recommendations

• Formulating semantics of probabilistic argumentation by characterizing subgraphs
• A labelling framework for probabilistic argumentation
• Formulating semantics of probabilistic argumentation by characterizing subgraphs: theory and empirical results
• Admissibility in Probabilistic Argumentation
• Probabilistic qualification of attack in abstract argumentation

Cited in

(2)

• Formulating semantics of probabilistic argumentation by characterizing subgraphs: theory and empirical results
• Investigation of semantic behavior in probabilistic argumentation

This page was built for publication: On probabilistic argumentation and subargument-completeness

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