A logical account of formal argumentation
From MaRDI portal
Publication:2269515
DOI10.1007/s11225-009-9218-xzbMath1188.03011MaRDI 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
03B45: Modal logic (including the logic of norms)
68T27: Logic in artificial intelligence
03F45: Provability logics and related algebras (e.g., diagonalizable algebras)
Related Items
Abduction in argumentation frameworks, Unnamed Item, Judgment Aggregation in Abstract Dialectical Frameworks, Optimization of dialectical outcomes in dialogical argumentation, Looking-ahead in backtracking algorithms for abstract argumentation, Toward incremental computation of argumentation semantics: a decomposition-based approach, Complexity-sensitive decision procedures for abstract argumentation, Algorithms for decision problems in argument systems under preferred semantics, Probabilistic argumentation: an equational approach, Graph aggregation, Theory of semi-instantiation in abstract argumentation, Equilibrium states in numerical argumentation networks, Characteristics of multiple viewpoints in abstract argumentation, Conflict-free and conflict-tolerant semantics for constrained argumentation frameworks, On the impact of configuration on abstract argumentation automated reasoning, 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, 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, Towards fixed-parameter tractable algorithms for abstract argumentation, Augmenting tractable fragments of abstract argumentation, A logic of argumentation for specification and verification of abstract argumentation frameworks, Dung's argumentation is essentially equivalent to classical propositional logic with the Peirce-Quine dagger, A generalized proof-theoretic approach to logical argumentation based on hypersequents, Semantics for higher level attacks in extended argumentation frames. I: Overview, Fibring argumentation frames, Annotation theories over finite graphs, Realizability of three-valued semantics for abstract dialectical frameworks, How we designed winning algorithms for abstract argumentation and which insight we attained, 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, Labellings for assumption-based and abstract argumentation, A QBF-based formalization of abstract argumentation semantics, TOWARD A COMPUTATIONAL ANALYSIS OF PROBABILISTIC ARGUMENTATION FRAMEWORKS, An Equational Approach to Logic Programming, Conflict-Tolerant Semantics for Argumentation Frameworks, Introducing Equational Semantics for Argumentation Networks, Principles Of Talmudic Logic, Modal and Temporal Argumentation Networks
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
