On efficiently estimating the probability of extensions in abstract argumentation frameworks
type: Item
instance of: scholarly article
title: On efficiently estimating the probability of extensions in abstract argumentation frameworks
zbMATH Open document ID: 1344.68221
author: Bettina Fazzinga
author: Sergio Flesca
author: Francesco Parisi
published in: International Journal of Approximate Reasoning
publication date: 2015-12-28T00:00:00Z
Mathematics Subject Classification ID: 68T27
Mathematics Subject Classification ID: 68T37
zbMATH DE Number: 6524456
zbMATH Keywords: probabilistic reasoning
zbMATH Keywords: argumentation systems
zbMATH Keywords: Monte-Carlo simulation
describes a project that uses: ASPARTIX
describes a project that uses: Dungine
MaRDI profile type: Publication
full work available at URL: j.ijar.2015.11.009
OpenAlex ID: W2262675902
cites work: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
cites work: Computing ideal sceptical argumentation
cites work: The computational complexity of ideal semantics
cites work: Q3455611
cites work: A probabilistic approach to modelling uncertain logical arguments
cites work: On the Complexity of Probabilistic Abstract Argumentation Frameworks
cites work: TOWARD A COMPUTATIONAL ANALYSIS OF PROBABILISTIC ARGUMENTATION FRAMEWORKS
cites work: Computing the Grounded Semantics in all the Subgraphs of an Argumentation Framework: An Empirical Evaluation
cites work: Probabilistic qualification of attack in abstract argumentation
cites work: Persuasion in Practical Argument Using Value-based Argumentation Frameworks
cites work: A new approach for preference-based argumentation frameworks
cites work: A reasoning model based on the production of acceptable arguments
cites work: Reasoning about preferences in argumentation frameworks
cites work: Formalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unification
cites work: A logic programming framework for possibilistic argumentation: Formalization and logical properties
cites work: Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks
cites work: Complexity of semi-stable and stage semantics in argumentation frameworks
cites work: The \(cf2\) argumentation semantics revisited
cites work: Algorithms and complexity results for persuasive argumentation
cites work: Probabilistic argumentation systems
cites work: Belief Revision in Structured Probabilistic Argumentation
cites work: Defeasible logic programming: an argumentative approach
cites work: Modelling argument accrual with possibilistic uncertainty in a logic programming setting
cites work: Methods for solving reasoning problems in abstract argumentation -- a survey
cites work: Probabilistic logic programming
cites work: Q4242057
cites work: Probabilistic logic programming with conditional constraints
cites work: Consistency checking and querying in probabilistic databases under integrity constraints
cites work: The independent choice logic for modelling multiple agents under uncertainty
cites work: Probabilistic description logic programs
cites work: Probabilistic Databases
DOI: 10.1016/J.IJAR.2015.11.009
description: scientific article; zbMATH DE number 6524456