Pages that link to "Item:Q3533125"
From MaRDI portal
The following pages link to On the Issue of Reinstatement in Argumentation (Q3533125):
Displaying 50 items.
- Optimization of dialectical outcomes in dialogical argumentation (Q324665) (← links)
- Toward incremental computation of argumentation semantics: a decomposition-based approach (Q360248) (← links)
- Characterizing strong equivalence for argumentation frameworks (Q420788) (← links)
- On the input/output behavior of argumentation frameworks (Q464629) (← links)
- Approximating operators and semantics for abstract dialectical frameworks (Q490444) (← links)
- Conflict-free and conflict-tolerant semantics for constrained argumentation frameworks (Q901144) (← links)
- Skepticism relations for comparing argumentation semantics (Q962903) (← links)
- On the evaluation of argumentation formalisms (Q1028909) (← links)
- On principle-based evaluation of extension-based argumentation semantics (Q1028948) (← 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)
- A characterization of types of support between structured arguments and their relationship with support in abstract argumentation (Q1748533) (← links)
- Augmenting tractable fragments of abstract argumentation (Q1761284) (← links)
- Dung's argumentation is essentially equivalent to classical propositional logic with the Peirce-Quine dagger (Q1941728) (← links)
- Graded labellings for abstract argumentation (Q2105593) (← links)
- Indepth combinatorial analysis of admissible sets for abstract argumentation (Q2107484) (← links)
- Gödel semantics of fuzzy argumentation frameworks with consistency degrees (Q2130020) (← links)
- An abstract argumentation and logic programming comparison based on 5-valued labellings (Q2146012) (← links)
- Acceptance in incomplete argumentation frameworks (Q2238645) (← links)
- Complete extensions in argumentation coincide with 3-valued stable models in logic programming (Q2269506) (← links)
- Meta-argumentation modelling. I: Methodology and techniques (Q2269509) (← links)
- A logical account of formal argumentation (Q2269515) (← links)
- How we designed winning algorithms for abstract argumentation and which insight we attained (Q2289004) (← links)
- A comprehensive study of argumentation frameworks with sets of attacking arguments (Q2330011) (← links)
- On three-valued acceptance conditions of abstract dialectical frameworks (Q2333663) (← links)
- On the equivalence between logic programming semantics and argumentation semantics (Q2344367) (← links)
- Rethinking specificity in defeasible reasoning and its effect in argument reinstatement (Q2401637) (← links)
- Labellings for assumption-based and abstract argumentation (Q2406908) (← links)
- A paradox of expert rights in abstract argumentation (Q2417385) (← links)
- A QBF-based formalization of abstract argumentation semantics (Q2446545) (← links)
- A neural cognitive model of argumentation with application to legal inference and decision making (Q2447172) (← links)
- A general approach to extension-based semantics in abstract argumentation (Q2680804) (← links)
- A definition of sceptical semantics in the constellations approach (Q2694551) (← links)
- On restricting the impact of self-attacking arguments in gradual semantics (Q2695512) (← links)
- Towards a general theory of decomposability in abstract argumentation (Q2695514) (← links)
- Towards a sound and complete dialogue system for handling enthymemes (Q2695533) (← links)
- A Two-Phase Dialogue Game for Skeptical Preferred Semantics (Q2835904) (← links)
- Conflict-Tolerant Semantics for Argumentation Frameworks (Q2915055) (← links)
- Reinstatement and the Requirement of Maximal Specificity in Argument Systems (Q2938132) (← links)
- Hybrid Reasoning on a Bipolar Argumentation Framework (Q3297805) (← links)
- Local Expansion Invariant Operators in Argumentation Semantics (Q3305687) (← links)
- An Algorithm for Computing Semi-stable Semantics (Q3524932) (← links)
- Modal and Temporal Argumentation Networks (Q3587249) (← links)
- Dynamics in Argumentation with Single Extensions: Abstraction Principles and the Grounded Extension (Q3638142) (← links)
- Logical limits of abstract argumentation frameworks (Q4583317) (← links)
- Equivalence in logic-based argumentation (Q4583352) (← links)
- Broadening Label-Based Argumentation Semantics with May-Must Scales (Q5098740) (← links)
- An empirical and axiomatic comparison of ranking-based semantics for abstract argumentation (Q6056713) (← links)
- Dynamic epistemic logics for abstract argumentation (Q6147179) (← links)
- On \(\mathcal{F} \)-systems: a graph-theoretic model for paradoxes involving a falsity predicate and its application to argumentation frameworks (Q6169322) (← links)
