The following pages link to ASPARTIX (Q20819):
Displaying 17 items.
- Toward incremental computation of argumentation semantics: a decomposition-based approach (Q360248) (← links)
- Algorithms for decision problems in argument systems under preferred semantics (Q490457) (← links)
- AFRA: argumentation framework with recursive attacks (Q622279) (← links)
- On efficiently estimating the probability of extensions in abstract argumentation frameworks (Q899472) (← links)
- The first international competition on computational models of argumentation: results and analysis (Q1677447) (← links)
- On the impact of configuration on abstract argumentation automated reasoning (Q1687275) (← links)
- Argumentation frameworks as constraint satisfaction problems (Q2248522) (← links)
- A distributed argumentation algorithm for mining consistent opinions in weighted Twitter discussions (Q2317506) (← links)
- Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence (Q2321260) (← links)
- Probabilistic qualification of attack in abstract argumentation (Q2353976) (← links)
- A probabilistic approach to modelling uncertain logical arguments (Q2375344) (← links)
- Weighted argumentation for analysis of discussions in Twitter (Q2409095) (← links)
- A QBF-based formalization of abstract argumentation semantics (Q2446545) (← links)
- Solving Weighted Argumentation Frameworks with Soft Constraints (Q3085933) (← links)
- Partial Semantics of Argumentation (Q3094004) (← links)
- A Schema for Generating Relevant Logic Programming Semantics and its Applications in Argumentation Theory (Q3100169) (← links)
- Partial semantics of argumentation: basic properties and empirical (Q5300581) (← links)
