A labelling framework for probabilistic argumentation
DOI10.1007/S10472-018-9574-1zbMATH Open1459.68197arXiv1708.00109OpenAlexW2741916207WikidataQ130108178 ScholiaQ130108178MaRDI QIDQ722102FDOQ722102
Pietro Baroni, Yang Gao, Antonino Rotolo, Guido Governatori, Giovanni Sartor, Rรฉgis Riveret
Publication date: 20 July 2018
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.00109
probabilistic argumentationprobabilistic abstract argumentationprobabilistic labellingsprobabilistic rule-based argumentation
Reasoning under uncertainty in the context of artificial intelligence (68T37) Logic in artificial intelligence (68T27)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- AFRA: argumentation framework with recursive attacks
- Argumentation in artificial intelligence
- An abstract, argumentation-theoretic approach to default reasoning
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- Set Theory
- A probabilistic approach to modelling uncertain logical arguments
- On the Complexity of Probabilistic Abstract Argumentation Frameworks
- Argument-based extended logic programming with defeasible priorities
- Argumentation Semantics for Defeasible Logic
- Robust semantics for argumentation frameworks
- Norms and Learning in Probabilistic Logic-Based Agents
- Probabilistic argumentation: an equational approach
- Constraint Handling Rules
- Probabilistic argumentation
- An approach to abstract argumentation with recursive attack and support
- Justification and defeat
- Bipolarity in argumentation graphs: towards a better understanding
- TOWARD A COMPUTATIONAL ANALYSIS OF PROBABILISTIC ARGUMENTATION FRAMEWORKS
- Closure and consistency in logic-associated argumentation
- Jumping to Conclusions
- Explaining Bayesian Networks Using Argumentation
- Formulating Semantics of Probabilistic Argumentation by Characterizing Subgraphs
- CHR(PRISM)-based probabilistic logic learning
- Formulating semantics of probabilistic argumentation by characterizing subgraphs: theory and empirical results
- Probabilistic Reasoning with Abstract Argumentation Frameworks
- Probabilistic legal reasoning in CHRiSM
- On efficiently estimating the probability of extensions in abstract argumentation frameworks
Cited In (6)
- Reduced meet over labelling-based semantics in abstract argumentation
- On searching explanatory argumentation graphs
- A probabilistic deontic argumentation framework
- Labellings for assumption-based and abstract argumentation
- A polynomial-time fragment of epistemic probabilistic argumentation
- A labeled argumentation framework
Uses Software
Recommendations
- A labeled argumentation framework ๐ ๐
- Labellings for assumption-based and abstract argumentation ๐ ๐
- TOWARD A COMPUTATIONAL ANALYSIS OF PROBABILISTIC ARGUMENTATION FRAMEWORKS ๐ ๐
- Probabilistic Reasoning with Abstract Argumentation Frameworks ๐ ๐
- An AIF-Based Labeled Argumentation Framework ๐ ๐
- Title not available (Why is that?) ๐ ๐
This page was built for publication: A labelling framework for probabilistic argumentation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q722102)