A logical account of formal argumentation
From MaRDI portal
Publication:2269515
DOI10.1007/s11225-009-9218-xzbMath1188.03011OpenAlexW2003822553MaRDI QIDQ2269515
Martin Caminada, Dov M. Gabbay
Publication date: 17 March 2010
Published in: Studia Logica (Search for Journal in Brave)
Full work available at URL: http://orbilu.uni.lu/handle/10993/16339
Modal logic (including the logic of norms) (03B45) Logic in artificial intelligence (68T27) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)
Related Items (55)
An Equational Approach to Logic Programming ⋮ Generalizing complete semantics to bipolar argumentation frameworks ⋮ Optimization of dialectical outcomes in dialogical argumentation ⋮ Looking-ahead in backtracking algorithms for abstract argumentation ⋮ Conflict-Tolerant Semantics for Argumentation Frameworks ⋮ Shedding new light on the foundations of abstract argumentation: modularization and weak admissibility ⋮ Toward incremental computation of argumentation semantics: a decomposition-based approach ⋮ Labellings for assumption-based and abstract argumentation ⋮ Admissibility in Probabilistic Argumentation ⋮ Expressiveness of SETAFs and support-free ADFs under 3-valued semantics ⋮ On the impact of configuration on abstract argumentation automated reasoning ⋮ A logic of argumentation for specification and verification of abstract argumentation frameworks ⋮ A general approach to extension-based semantics in abstract argumentation ⋮ Equilibrium states in numerical argumentation networks ⋮ Characteristics of multiple viewpoints in abstract argumentation ⋮ Syntactic reasoning with conditional probabilities in deductive 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 ⋮ Fuzzy labeling semantics for quantitative argumentation ⋮ On the responsibility for undecisiveness in preferred and stable labellings in abstract argumentation ⋮ Characterizing acceptability semantics of argumentation frameworks with recursive attack and support relations ⋮ Unnamed Item ⋮ Axiom of Choice, Maximal Independent Sets, Argumentation and Dialogue Games ⋮ A QBF-based formalization of abstract argumentation semantics ⋮ From fine-grained properties to broad principles for gradual argumentation: a principled spectrum ⋮ Empirical evaluation of abstract argumentation: supporting the need for bipolar and probabilistic approaches ⋮ Complexity-sensitive decision procedures for abstract argumentation ⋮ Algorithms for decision problems in argument systems under preferred semantics ⋮ Principles Of Talmudic Logic ⋮ Probabilistic argumentation: an equational approach ⋮ Introducing Equational Semantics for Argumentation Networks ⋮ Graph aggregation ⋮ Theory of semi-instantiation in abstract argumentation ⋮ Towards fixed-parameter tractable algorithms for abstract argumentation ⋮ Augmenting tractable fragments of abstract argumentation ⋮ Judgment Aggregation in Abstract Dialectical Frameworks ⋮ Modal and Temporal Argumentation Networks ⋮ Semantics for higher level attacks in extended argumentation frames. I: Overview ⋮ Fibring argumentation frames ⋮ Annotation theories over finite graphs ⋮ A generalized proof-theoretic approach to logical argumentation based on hypersequents ⋮ TOWARD A COMPUTATIONAL ANALYSIS OF PROBABILISTIC ARGUMENTATION FRAMEWORKS ⋮ Abduction in argumentation frameworks ⋮ Realizability of three-valued semantics for abstract dialectical frameworks ⋮ How we designed winning algorithms for abstract argumentation and which insight we attained ⋮ Event-based time-stamped claim logic ⋮ Delegated updates in epistemic graphs for opponent modelling ⋮ A polynomial-time fragment of epistemic probabilistic argumentation ⋮ Epistemic graphs for representing and reasoning with positive and negative influences of arguments ⋮ A comprehensive study of argumentation frameworks with sets of attacking arguments ⋮ On three-valued acceptance conditions of abstract dialectical frameworks ⋮ Methods for solving reasoning problems in abstract argumentation -- a survey ⋮ On the equivalence between logic programming semantics and argumentation semantics ⋮ Graded labellings for abstract argumentation
Cites Work
- A mathematical treatment of defeasible reasoning and its implementation.
- On the evaluation of argumentation formalisms
- Computing ideal sceptical argumentation
- On principle-based evaluation of extension-based argumentation semantics
- Many-dimensional modal logics: theory and applications
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- Complete extensions in argumentation coincide with 3-valued stable models in logic programming
- Modal provability foundations for argumentation networks
- Logical modes of attack in argumentation networks
- Fibring argumentation frames
- Argument-based extended logic programming with defeasible priorities
- Comparing Argumentation Semantics with Respect to Skepticism
- An Algorithm for Computing Semi-stable Semantics
- On the Issue of Reinstatement in Argumentation
- A Logic of Abstract Argumentation
- Robust semantics for argumentation frameworks
This page was built for publication: A logical account of formal argumentation
