Probabilistic abstract argumentation frameworks, a possible world view

@article{Mantadelis2020ProbabilisticAA,
  title={Probabilistic abstract argumentation frameworks, a possible world view},
  author={Theofrastos Mantadelis and S. Bistarelli},
  journal={Int. J. Approx. Reason.},
  year={2020},
  volume={119},
  pages={204-219}
}
Explainable Acceptance in Probabilistic Abstract Argumentation: Complexity and Approximation
TLDR
It is shown that the complexity of the problem is FP-hard and polynomial approximation algorithms with bounded additive error are proposed for probabilistic argumentation frameworks where odd-length cycles are forbidden and, quite surprising, such kind of approximation algorithm does not exist for the related FPhard problem of computing the probability of the credulous acceptance of an argument.
SMProbLog: Stable Model Semantics in ProbLog and its Applications in Argumentation
TLDR
SMProbLog is introduced, a generalization of the probabilistic logic programming language ProbLog that generalizes the semantics of ProbLog to the setting where multiple truth assignments are possible for a randomly sampled program, and implements the corresponding algorithms for both inference and learning tasks.
Epistemic Argumentation with Conditional Probabilities and Labeling Constraints
We extend epistemic graphs, a powerful representation language employed in argumentation theory, first, by allowing conditional probabilities in that language. We also offer a new way of interpreting
Neuro-Symbolic Probabilistic Argumentation Machines
TLDR
This paper proposes to train networks on argument labellings explaining the data, so that any sampled data outcome is associated with an argument labelling, and reveals that such argumentation Boltzmann machines can outperform other classification models, especially in noisy settings.
Imprecise abstract argumentation as a support for forensic engineering
TLDR
This work is the first use of the abstract argument framework in civil engineering and so in forensic engineering and provides an innovative model based on imprecise probability for AAF.

References

SHOWING 1-10 OF 46 REFERENCES
On the Complexity of Probabilistic Abstract Argumentation
TLDR
This work addresses the fundamental problem of computing the probability that a set of arguments is an extension according to a given semantics, focusing on the most popular semantics, and shows the following dichotomy result.
A Probabilistic Semantics for abstract Argumentation
TLDR
A probabilistic semantics for abstract argumentation that assigns probabilities or degrees of belief to individual arguments is proposed that allows for a more fine-grained differentiation between those two extreme views on reasoning.
Probabilistic Argumentation Frameworks - A Logical Approach
TLDR
This paper characterize different semantics from the approach of Li et al in terms of probabilistic logic, which not only provides a uniform logical formalization but also might pave the way for future implementations of abstract argumentation.
Probabilistic Reasoning with Abstract Argumentation Frameworks
TLDR
A general framework to measure the amount of conflict of inconsistent assessments and provide a method for inconsistency-tolerant reasoning is presented.
Probabilistic Argumentation Frameworks
TLDR
This paper extends Dung's seminal argument framework to form a probabilistic argument framework by associating probabilities with arguments and defeats, and describes an approximate approach to computing these likelihoods based on Monte-Carlo simulation.
A probabilistic approach to modelling uncertain logical arguments
  • A. Hunter
  • Philosophy, Mathematics
    Int. J. Approx. Reason.
  • 2013
An introduction to argumentation semantics
TLDR
The paper presents an extensive set of general properties for semantics evaluation and analyzes the notions of argument justification and skepticism, and discusses some relationships between semantics properties and domain-specific requirements.
Complexity of Fundamental Problems in Probabilistic Abstract Argumentation: Beyond Independence (Extended Abstract)
TLDR
In order to study the impact of different correlations between arguments/defeats on the complexity, a new form of prAAF is introduced, called GEN, based on the well-known paradigm of worldset sets, which allows the correlations to be easily distinguishable.
TOWARD A COMPUTATIONAL ANALYSIS OF PROBABILISTIC ARGUMENTATION FRAMEWORKS
TLDR
This work contributes to their computational analysis by proposing a first recursive algorithm to compute the probability of acceptance of each argument under grounded and preferred semantics and by studying the behavior of PAFs with respect to reinstatement, cycles, and changes in argument structure.
cf2 Semantics Revisited
TLDR
This work provides an alternative characterization of cf2 semantics, which, roughly speaking, avoids the recursive computation of sub-frameworks, and provides the concrete ASP-encodings, which are incorporated within the ASPARTIX system, a platform which already implements a wide range of semantics for abstract argumentation.
...
1
2
3
4
5
...