Explainable acceptance in probabilistic and incomplete abstract argumentation frameworks
From MaRDI portal
Publication:6080638
DOI10.1016/j.artint.2023.103967MaRDI QIDQ6080638
Gianvincenzo Alfano, Irina Trubitsyna, Francesco Parisi, Marco Calautti, Sergio Greco
Publication date: 4 October 2023
Published in: Artificial Intelligence (Search for Journal in Brave)
explanationsformal argumentationincomplete argumentation frameworkprobabilistic argumentation framework
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Argument graphs and assumption-based argumentation
- A quantitative approach to belief revision in structured probabilistic argumentation
- On the input/output behavior of argumentation frameworks
- Complexity-sensitive decision procedures for abstract argumentation
- Belief revision in structured probabilistic argumentation, model and application to cyber security
- Verification in incomplete argumentation frameworks
- Using arguments for making and explaining decisions
- Probabilistic (logic) programming concepts
- On efficiently estimating the probability of extensions in abstract argumentation frameworks
- Argumentation in artificial intelligence
- Computing ideal sceptical argumentation
- On principle-based evaluation of extension-based argumentation semantics
- Probabilistic satisfiability
- Some observations on the probabilistic algorithms and NP-hard problems
- Probabilistic logic programming
- Explanation and argumentation capabilities: towards the creation of more persuasive agents
- A novel weighted defence and its relaxation in abstract argumentation
- Empirical evaluation of abstract argumentation: supporting the need for bipolar and probabilistic approaches
- Probabilistic spatio-temporal knowledge bases: capacity constraints, count queries, and consistency checking
- Coherence in finite argument systems.
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- Evaluation of argument strength in attack graphs: foundations and semantics
- Strong explanations for nonmonotonic reasoning
- A probabilistic deontic argumentation framework
- Computational complexity of flat and generic assumption-based argumentation, with and without probabilities
- Acceptance in incomplete argumentation frameworks
- An AGM-style belief revision mechanism for probabilistic spatio-temporal logics
- Probabilistic abstract argumentation frameworks, a possible world view
- A polynomial-time fragment of epistemic probabilistic argumentation
- Explanation in artificial intelligence: insights from the social sciences
- Strong inconsistency
- Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence
- Probabilistic qualification of attack in abstract argumentation
- A probabilistic approach to modelling uncertain logical arguments
- Labellings for assumption-based and abstract argumentation
- SCC-recursiveness: a general schema for argumentation semantics
- Probabilistic logic revisited
- TOWARD A COMPUTATIONAL ANALYSIS OF PROBABILISTIC ARGUMENTATION FRAMEWORKS
- On the Complexity of Probabilistic Abstract Argumentation Frameworks
- RP-DeLP: a weighted defeasible argumentation framework based on a recursive semantics
- Probabilistic Databases
- Towards a Common Framework for Dialectical Proof Procedures in Abstract Argumentation
- On the Semantics of Abstract Argumentation Frameworks: A Logic Programming Approach
- Computational Complexity
- Probability Inequalities for Sums of Bounded Random Variables