scientific article
From MaRDI portal
Publication:3455611
zbMath1327.68290MaRDI QIDQ3455611
Publication date: 11 December 2015
Full work available at URL: http://ebooks.iospress.nl/volumearticle/7064
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (34)
A quantitative approach to belief revision in structured probabilistic argumentation ⋮ Argument strength in probabilistic argumentation using confirmation theory ⋮ Optimization of dialectical outcomes in dialogical argumentation ⋮ The first international competition on computational models of argumentation: results and analysis ⋮ Inference procedures and engine for probabilistic argumentation ⋮ Admissibility in Probabilistic Argumentation ⋮ Argument strength in probabilistic argumentation based on defeasible rules ⋮ On the Complexity of Probabilistic Abstract Argumentation Frameworks ⋮ Explainable acceptance in probabilistic and incomplete abstract argumentation frameworks ⋮ Syntactic reasoning with conditional probabilities in deductive argumentation ⋮ Probabilistic causal bipolar abstract argumentation: an approach based on credal networks ⋮ On efficiently estimating the probability of extensions in abstract argumentation frameworks ⋮ Taking into account ``who said what in abstract argumentation: complexity results ⋮ A filtering-based general approach to learning rational constraints of epistemic graphs ⋮ A definition of sceptical semantics in the constellations approach ⋮ On the responsibility for undecisiveness in preferred and stable labellings in abstract argumentation ⋮ Empirical evaluation of abstract argumentation: supporting the need for bipolar and probabilistic approaches ⋮ Probabilistic argumentation: an equational approach ⋮ Revealed preference in argumentation: algorithms and applications ⋮ Computational complexity of flat and generic assumption-based argumentation, with and without probabilities ⋮ An approach to characterize graded entailment of arguments through a label-based framework ⋮ Belief revision in structured probabilistic argumentation, model and application to cyber security ⋮ TOWARD A COMPUTATIONAL ANALYSIS OF PROBABILISTIC ARGUMENTATION FRAMEWORKS ⋮ A labelling framework for probabilistic argumentation ⋮ Probabilistic sentence satisfiability: an approach to PSAT ⋮ Probabilistic abstract argumentation frameworks, a possible world view ⋮ Delegated updates in epistemic graphs for opponent modelling ⋮ A polynomial-time fragment of epistemic probabilistic argumentation ⋮ Epistemic graphs for representing and reasoning with positive and negative influences of arguments ⋮ Evaluation of argument strength in attack graphs: foundations and semantics ⋮ A distributed argumentation algorithm for mining consistent opinions in weighted Twitter discussions ⋮ Correct Grounded Reasoning with Presumptive Arguments ⋮ Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence ⋮ Probabilistic qualification of attack in abstract argumentation
This page was built for publication: