Probabilistic qualification of attack in abstract argumentation
From MaRDI portal
Publication:2353976
Recommendations
Cites work
- A logic programming framework for possibilistic argumentation: Formalization and logical properties
- A logic-based theory of deductive arguments
- A probabilistic approach to modelling uncertain logical arguments
- A probabilistic semantics for abstract argumentation
- A proof theoretic approach to qualitative probabilistic reasoning
- A reasoning model based on the production of acceptable arguments
- A relevance-theoretic framework for constructing and deconstructing enthymemes
- Argumentation in artificial intelligence
- Argumentation in Multi-Agent Systems
- Argumentation through a distributed self-stabilizing approach
- Computing ideal sceptical argumentation
- Cost-bounded argumentation
- Defining normative systems for qualitative argumentation
- Dialectic proof procedures for assumption-based, admissible argumentation
- scientific article; zbMATH DE number 1852916 (Why is no real title available?)
- Jumping to conclusions. A logico-probabilistic foundation for defeasible rule-based arguments
- Mechanizing Mathematical Reasoning
- On Decision Problems Related to the Preferred Semantics for Argumentation Frameworks
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
- Persuasion in Practical Argument Using Value-based Argumentation Frameworks
- Probabilistic argumentation systems
- Qualitative methods for reasoning under uncertainty
- Reasoning about preferences in argumentation frameworks
- Semantics and complexity of abduction from default theories
- Using probabilistic argumentation for key validation in public-key cryptography
- Weighted argument systems: basic definitions, algorithms, and complexity results
Cited in
(33)- A graded approach to database repair by context-aware distance semantics
- Inference procedures and engine for probabilistic argumentation
- Proximity semantics for topic-based abstract argumentation
- Probabilistic argumentation: an approach based on conditional probability. A preliminary report
- Computational complexity of flat and generic assumption-based argumentation, with and without probabilities
- A general approach to reasoning with probabilities
- A formal framework for deliberated judgment
- A polynomial-time fragment of epistemic probabilistic argumentation
- A distributed argumentation algorithm for mining consistent opinions in weighted Twitter discussions
- Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence
- A probabilistic approach to modelling uncertain logical arguments
- Focusing the argumentative process: neighborhood-based semantics in abstract argumentation
- Correct grounded reasoning with presumptive arguments
- On the complexity of probabilistic abstract argumentation frameworks
- Optimization of dialectical outcomes in dialogical argumentation
- Formulating semantics of probabilistic argumentation by characterizing subgraphs
- Encompassing Attacks to Attacks in Abstract Argumentation Frameworks
- Argumentation for practical reasoning: an axiomatic approach
- Dialectical Proof Procedures for Probabilistic Abstract Argumentation
- Theory of disjunctive attacks, Part I
- On probabilistic argumentation and subargument-completeness
- Belief in attacks in epistemic probabilistic argumentation
- Probabilistic Three-Valued Argumentation Frameworks
- Argumentation framework based on evidence theory
- Epistemic attack semantics
- Forecasting with jury-based probabilistic argumentation
- Explainable acceptance in probabilistic and incomplete abstract argumentation frameworks
- Probabilistic causal bipolar abstract argumentation: an approach based on credal networks
- Neighborhood-based argumental community support in the context of multi-topic debates
- Verification in incomplete argumentation frameworks
- Stability of extensions in incomplete argumentation frameworks
- Tabulation proof procedures for fuzzy linguistic logic programming
- On efficiently estimating the probability of extensions in abstract argumentation frameworks
This page was built for publication: Probabilistic qualification of attack in abstract argumentation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2353976)
