On the complexity of probabilistic abstract argumentation frameworks
From MaRDI portal
Recommendations
- On efficiently estimating the probability of extensions in abstract argumentation frameworks
- Probabilities on extensions in abstract argumentation
- A probabilistic semantics for abstract argumentation
- Toward a computational analysis of probabilistic argumentation frameworks
- Probabilistic abstract dialectical frameworks
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1220670 (Why is no real title available?)
- scientific article; zbMATH DE number 1285158 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1926641 (Why is no real title available?)
- A logic programming framework for possibilistic argumentation: Formalization and logical properties
- A new approach for preference-based argumentation frameworks
- A possibilistic argumentation decision making framework with default reasoning
- A probabilistic approach to modelling uncertain logical arguments
- A probabilistic semantics for abstract argumentation
- A reasoning model based on the production of acceptable arguments
- Algorithms and complexity results for persuasive argumentation
- An argumentation framework in default logic
- Argumentation in artificial intelligence
- Complexity of semi-stable and stage semantics in argumentation frameworks
- Complexity-sensitive decision procedures for abstract argumentation
- Consistency checking and querying in probabilistic databases under integrity constraints
- Formalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unification
- Knowledge compilation meets database theory: compiling queries to decision diagrams
- On efficiently estimating the probability of extensions in abstract 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
- Polynomial-time 1-Turing reductions from \(\#\)PH to \(\#\)P
- Probabilistic argumentation systems
- Probabilistic databases
- Probabilistic description logic programs
- Probabilistic logic programming
- Probabilistic logic programming with conditional constraints
- Probabilistic qualification of attack in abstract argumentation
- Reasoning about preferences in argumentation frameworks
- SCC-recursiveness: a general schema for argumentation semantics
- Semi-stable semantics
- Skepticism relations for comparing argumentation semantics
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- The cf2 argumentation semantics revisited
- The complexity of computing the permanent
- The computational complexity of ideal semantics
- The independent choice logic for modelling multiple agents under uncertainty
- Treewidth in Verification: Local vs. Global
- Weighted argument systems: basic definitions, algorithms, and complexity results
Cited in
(42)- Empirical evaluation of abstract argumentation: supporting the need for bipolar and probabilistic approaches
- Admissibility in Probabilistic Argumentation
- Formulating semantics of probabilistic argumentation by characterizing subgraphs: theory and empirical results
- Computational complexity of flat and generic assumption-based argumentation, with and without probabilities
- Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence
- Stability of extensions in incomplete argumentation frameworks
- Cost-bounded argumentation
- Dialectical Proof Procedures for Probabilistic Abstract Argumentation
- Probabilistic abstract argumentation frameworks, a possible world view
- Incremental computation of deterministic extensions for dynamic argumentation frameworks
- A quantitative approach to belief revision in structured probabilistic argumentation
- Taking into account ``who said what in abstract argumentation: complexity results
- Temporal duration-based probabilistic argumentation frameworks
- A labelling framework for probabilistic argumentation
- Acceptance in incomplete argumentation frameworks
- On the semantics of abstract argumentation frameworks: a logic programming approach
- Belief revision in structured probabilistic argumentation, model and application to cyber security
- On efficiently estimating the probability of extensions in abstract argumentation frameworks
- Probabilities on extensions in abstract argumentation
- Abstract argumentation with Markov networks
- Explainable acceptance in probabilistic and incomplete abstract argumentation frameworks
- Complexity of nonemptiness in control argumentation frameworks
- Revisiting the notions of extension and acceptance over incomplete abstract argumentation frameworks
- The complexity landscape of claim-augmented argumentation frameworks
- Toward a computational analysis of probabilistic argumentation frameworks
- Formulating semantics of probabilistic argumentation by characterizing subgraphs
- Complexity-sensitive decision procedures for abstract argumentation
- A probabilistic semantics for abstract argumentation
- Inference procedures and engine for probabilistic argumentation
- Complexity of Possible and Necessary Existence Problems in Abstract Argumentation
- A general approach to reasoning with probabilities
- Constraints and lifting-based (conditional) preferences in abstract argumentation
- Probabilistic abstract dialectical frameworks
- Probabilistic graded semantics
- A definition of sceptical semantics in the constellations approach
- A practical account into counting Dung's extensions by dynamic programming
- A polynomial-time fragment of epistemic probabilistic argumentation
- Epistemic graphs for representing and reasoning with positive and negative influences of arguments
- An approach to characterize graded entailment of arguments through a label-based framework
- On the maximal and average numbers of stable extensions
- A distributed argumentation algorithm for mining consistent opinions in weighted Twitter discussions
- Probabilistic qualification of attack in abstract argumentation
This page was built for publication: On the complexity of probabilistic abstract argumentation frameworks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946762)
