Explainable acceptance in probabilistic and incomplete abstract argumentation frameworks
From MaRDI portal
Publication:6080638
Cites work
- scientific article; zbMATH DE number 48344 (Why is no real title available?)
- scientific article; zbMATH DE number 2085265 (Why is no real title available?)
- A novel weighted defence and its relaxation in abstract argumentation
- A polynomial-time fragment of epistemic probabilistic argumentation
- A probabilistic approach to modelling uncertain logical arguments
- A probabilistic deontic argumentation framework
- A probabilistic semantics for abstract argumentation
- A quantitative approach to belief revision in structured probabilistic argumentation
- Acceptance in incomplete argumentation frameworks
- An AGM-style belief revision mechanism for probabilistic spatio-temporal logics
- Argument graphs and assumption-based argumentation
- Argumentation in artificial intelligence
- Belief revision in structured probabilistic argumentation, model and application to cyber security
- Coherence in finite argument systems.
- Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence
- Complexity-sensitive decision procedures for abstract argumentation
- Computational Complexity
- Computational complexity of flat and generic assumption-based argumentation, with and without probabilities
- Computing ideal sceptical argumentation
- Credulous and skeptical acceptance in incomplete argumentation frameworks
- Empirical evaluation of abstract argumentation: supporting the need for bipolar and probabilistic approaches
- Evaluation of argument strength in attack graphs: foundations and semantics
- Explaining non-acceptability in abstract argumentation
- Explanation and argumentation capabilities: towards the creation of more persuasive agents
- Explanation in artificial intelligence: insights from the social sciences
- Labellings for assumption-based and abstract argumentation
- On efficiently estimating the probability of extensions in abstract argumentation frameworks
- On principle-based evaluation of extension-based argumentation semantics
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
- On the complexity of probabilistic abstract argumentation frameworks
- On the input/output behavior of argumentation frameworks
- On the semantics of abstract argumentation frameworks: a logic programming approach
- Probabilistic (logic) programming concepts
- Probabilistic abstract argumentation frameworks, a possible world view
- Probabilistic databases
- Probabilistic logic programming
- Probabilistic logic revisited
- Probabilistic qualification of attack in abstract argumentation
- Probabilistic satisfiability
- Probabilistic spatio-temporal knowledge bases: capacity constraints, count queries, and consistency checking
- Probability Inequalities for Sums of Bounded Random Variables
- RP-DeLP: a weighted defeasible argumentation framework based on a recursive semantics
- SCC-recursiveness: a general schema for argumentation semantics
- Some observations on the probabilistic algorithms and NP-hard problems
- Strong explanations for nonmonotonic reasoning
- Strong inconsistency
- The complexity of counting problems
- Toward a computational analysis of probabilistic argumentation frameworks
- Towards a common framework for dialectical proof procedures in abstract argumentation
- Using arguments for making and explaining decisions
- Verification in incomplete argumentation frameworks
Cited in
(4)
This page was built for publication: Explainable acceptance in probabilistic and incomplete abstract argumentation frameworks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6080638)
