Pages that link to "Item:Q2946762"
From MaRDI portal
The following pages link to On the Complexity of Probabilistic Abstract Argumentation Frameworks (Q2946762):
Displaying 21 items.
- A quantitative approach to belief revision in structured probabilistic argumentation (Q287765) (← links)
- An approach to characterize graded entailment of arguments through a label-based framework (Q511660) (← links)
- Belief revision in structured probabilistic argumentation, model and application to cyber security (Q524938) (← links)
- A labelling framework for probabilistic argumentation (Q722102) (← links)
- On efficiently estimating the probability of extensions in abstract argumentation frameworks (Q899472) (← links)
- Inference procedures and engine for probabilistic argumentation (Q1678421) (← links)
- Empirical evaluation of abstract argumentation: supporting the need for bipolar and probabilistic approaches (Q1726415) (← links)
- Complexity of nonemptiness in control argumentation frameworks (Q2146008) (← links)
- Computational complexity of flat and generic assumption-based argumentation, with and without probabilities (Q2238615) (← links)
- Acceptance in incomplete argumentation frameworks (Q2238645) (← links)
- A general approach to reasoning with probabilities (Q2283285) (← links)
- Epistemic graphs for representing and reasoning with positive and negative influences of arguments (Q2303513) (← links)
- A distributed argumentation algorithm for mining consistent opinions in weighted Twitter discussions (Q2317506) (← links)
- Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence (Q2321260) (← links)
- A definition of sceptical semantics in the constellations approach (Q2694551) (← links)
- Incremental Computation of Deterministic Extensions for Dynamic Argumentation Frameworks (Q2835878) (← links)
- Formulating Semantics of Probabilistic Argumentation by Characterizing Subgraphs (Q3457708) (← links)
- Admissibility in Probabilistic Argumentation (Q5094045) (← links)
- On the Semantics of Abstract Argumentation Frameworks: A Logic Programming Approach (Q5140009) (← links)
- Explainable acceptance in probabilistic and incomplete abstract argumentation frameworks (Q6080638) (← links)
- Taking into account ``who said what'' in abstract argumentation: complexity results (Q6161469) (← links)