Pages that link to "Item:Q835125"

The following pages link to A logic programming framework for possibilistic argumentation: Formalization and logical properties (Q835125):

Displaying 17 items.

• A quantitative approach to belief revision in structured probabilistic argumentation (Q287765) (← links)
• Optimization of dialectical outcomes in dialogical argumentation (Q324665) (← links)
• An approach to decision making based on dynamic argumentation systems (Q343918) (← 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)
• On efficiently estimating the probability of extensions in abstract argumentation frameworks (Q899472) (← links)
• A labeled argumentation framework (Q901086) (← links)
• Inference procedures and engine for probabilistic argumentation (Q1678421) (← links)
• An approach to improve argumentation-based epistemic planning with contextual preferences (Q2105569) (← links)
• The possibilistic Horn non-clausal knowledge bases (Q2105624) (← links)
• Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence (Q2321260) (← links)
• Possibilistic nested logic programs and strong equivalence (Q2344722) (← links)
• Probabilistic qualification of attack in abstract argumentation (Q2353976) (← links)
• Semantics for Possibilistic Disjunctive Programs (Q2845121) (← links)
• Extending a Temporal Defeasible Argumentation Framework with Possibilistic Weights (Q2915075) (← links)
• On the Complexity of Probabilistic Abstract Argumentation Frameworks (Q2946762) (← links)
• Modelling Argument Accrual in Possibilistic Defeasible Logic Programming (Q3638144) (← links)