On the Issue of Reinstatement in Argumentation

DOI10.1007/11853886_11zbMath1152.68600OpenAlexW2129829265WikidataQ62044313 ScholiaQ62044313MaRDI QIDQ3533125

Martin Caminada

Publication date: 30 October 2008

Published in: Logics in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://dspace.library.uu.nl/handle/1874/24650

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Related Items (50)

Gödel semantics of fuzzy argumentation frameworks with consistency degrees ⋮ An abstract argumentation and logic programming comparison based on 5-valued labellings ⋮ Optimization of dialectical outcomes in dialogical argumentation ⋮ Conflict-Tolerant Semantics for Argumentation Frameworks ⋮ Toward incremental computation of argumentation semantics: a decomposition-based approach ⋮ Labellings for assumption-based and abstract argumentation ⋮ The first international competition on computational models of argumentation: results and analysis ⋮ Logical limits of abstract argumentation frameworks ⋮ Equivalence in logic-based argumentation ⋮ Broadening Label-Based Argumentation Semantics with May-Must Scales ⋮ A paradox of expert rights in abstract argumentation ⋮ RAFDivider  : a distributed algorithm for computing semantics in higher-order abstract argumentation frameworks ⋮ An empirical and axiomatic comparison of ranking-based semantics for abstract argumentation ⋮ On the impact of configuration on abstract argumentation automated reasoning ⋮ A general approach to extension-based semantics in abstract argumentation ⋮ Dynamic epistemic logics for abstract argumentation ⋮ Dung's argumentation is essentially equivalent to classical propositional logic with the Peirce-Quine dagger ⋮ Conflict-free and conflict-tolerant semantics for constrained argumentation frameworks ⋮ Characterizing strong equivalence for argumentation frameworks ⋮ On \(\mathcal{F} \)-systems: a graph-theoretic model for paradoxes involving a falsity predicate and its application to argumentation frameworks ⋮ Fuzzy labeling semantics for quantitative argumentation ⋮ A definition of sceptical semantics in the constellations approach ⋮ On restricting the impact of self-attacking arguments in gradual semantics ⋮ Towards a general theory of decomposability in abstract argumentation ⋮ Towards a sound and complete dialogue system for handling enthymemes ⋮ An Algorithm for Computing Semi-stable Semantics ⋮ A QBF-based formalization of abstract argumentation semantics ⋮ A neural cognitive model of argumentation with application to legal inference and decision making ⋮ On the input/output behavior of argumentation frameworks ⋮ Hybrid Reasoning on a Bipolar Argumentation Framework ⋮ Approximating operators and semantics for abstract dialectical frameworks ⋮ Local Expansion Invariant Operators in Argumentation Semantics ⋮ Acceptance in incomplete argumentation frameworks ⋮ A characterization of types of support between structured arguments and their relationship with support in abstract argumentation ⋮ Skepticism relations for comparing argumentation semantics ⋮ Augmenting tractable fragments of abstract argumentation ⋮ Modal and Temporal Argumentation Networks ⋮ Complete extensions in argumentation coincide with 3-valued stable models in logic programming ⋮ Meta-argumentation modelling. I: Methodology and techniques ⋮ A logical account of formal argumentation ⋮ How we designed winning algorithms for abstract argumentation and which insight we attained ⋮ Dynamics in Argumentation with Single Extensions: Abstraction Principles and the Grounded Extension ⋮ On the evaluation of argumentation formalisms ⋮ On principle-based evaluation of extension-based argumentation semantics ⋮ A Two-Phase Dialogue Game for Skeptical Preferred Semantics ⋮ A comprehensive study of argumentation frameworks with sets of attacking arguments ⋮ On three-valued acceptance conditions of abstract dialectical frameworks ⋮ On the equivalence between logic programming semantics and argumentation semantics ⋮ Graded labellings for abstract argumentation ⋮ Indepth combinatorial analysis of admissible sets for abstract argumentation

This page was built for publication: On the Issue of Reinstatement in Argumentation