A Generalization of Dung’s Abstract Framework for Argumentation: Arguing with Sets of Attacking Arguments
From MaRDI portal
Publication:5385341
DOI10.1007/978-3-540-75526-5_4zbMath1429.68266OpenAlexW1523879902MaRDI QIDQ5385341
Simon Parsons, Søren Holbech Nielsen
Publication date: 6 May 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-75526-5_4
Related Items (20)
Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving ⋮ Gradual semantics for weighted bipolar SETAFs ⋮ Inference procedures and engine for probabilistic argumentation ⋮ Broadening Label-Based Argumentation Semantics with May-Must Scales ⋮ Expressiveness of SETAFs and support-free ADFs under 3-valued semantics ⋮ A claim-centric perspective on abstract argumentation semantics: claim-defeat, principles, and expressiveness ⋮ Syntactic reasoning with conditional probabilities in deductive argumentation ⋮ Integrated preference argumentation and applications in consumer behaviour analyses ⋮ On the Equivalence Between Abstract Dialectical Frameworks and Logic Programs ⋮ On incompleteness in abstract argumentation: complexity and expressiveness ⋮ Handling support cycles and collective interactions in the logical encoding of higher-order bipolar argumentation frameworks ⋮ Characterizing acceptability semantics of argumentation frameworks with recursive attack and support relations ⋮ Abstract argumentation and explanation applied to scientific debates ⋮ Approximating operators and semantics for abstract dialectical frameworks ⋮ A general semi-structured formalism for computational argumentation: definition, properties, and examples of application ⋮ Theory of semi-instantiation in abstract argumentation ⋮ Realizability of three-valued semantics for abstract dialectical frameworks ⋮ Graph-classes of argumentation frameworks with collective attacks ⋮ Understanding the Abstract Dialectical Framework ⋮ A comprehensive study of argumentation frameworks with sets of attacking arguments
Cites Work
- Unnamed Item
- An abstract, argumentation-theoretic approach to default reasoning
- Abstract argumentation systems
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- A lattice-theoretical fixpoint theorem and its applications
- Argumentative logics: Reasoning with classically inconsistent information
- Agents that reason and negotiate by arguing
- DefLog: on the Logical Interpretation of Prima Facie Justified Assumptions
- Properties and Complexity of Some Formal Inter-agent Dialogues
- Collective Argumentation and Disjunctive Logic Programming
- Argument-based applications to knowledge engineering
- Defeasible logic programming: an argumentative approach
- Relating protocols for dynamic dispute with logics for defeasible argumentation
This page was built for publication: A Generalization of Dung’s Abstract Framework for Argumentation: Arguing with Sets of Attacking Arguments
