A general approach to extension-based semantics in abstract argumentation
From MaRDI portal
Publication:2680804
Cites work
- scientific article; zbMATH DE number 1748069 (Why is no real title available?)
- scientific article; zbMATH DE number 6902516 (Why is no real title available?)
- scientific article; zbMATH DE number 2243383 (Why is no real title available?)
- A general notion of equivalence for abstract argumentation
- A logic-based theory of deductive arguments
- A logical account of formal argumentation
- AFRA: argumentation framework with recursive attacks
- An abstract, argumentation-theoretic approach to default reasoning
- An abstract, logical approach to characterizing strong equivalence in non-monotonic knowledge representation formalisms
- An algebraic characterization of equivalent preferential models
- Argument based machine learning
- Argumentation in artificial intelligence
- Automata for infinite argumentation structures
- Characteristics of multiple viewpoints in abstract argumentation
- Characterizing strong equivalence for argumentation frameworks
- Computing ideal sceptical argumentation
- Continuous Lattices and Domains
- Design and results of the second international competition on computational models of argumentation
- Evaluation of argument strength in attack graphs: foundations and semantics
- Infinite argumentation frameworks. On the existence and uniqueness of extensions
- Law and logic: a review from an argumentation perspective
- Model theory.
- Normal and strong expansion equivalence for argumentation frameworks
- On rejected arguments and implicit conflicts: the hidden power of argumentation semantics
- On the Issue of Reinstatement in Argumentation
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
- On the evaluation of argumentation formalisms
- On the graded acceptability of arguments in abstract and instantiated argumentation
- On the input/output behavior of argumentation frameworks
- On the intertranslatability of argumentation semantics
- Parametric properties of ideal semantics
- Realizability of three-valued semantics for abstract dialectical frameworks
- Semi-stable semantics
- Set Theory
- Similarity between preferential models
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Two Representation Theorems for Non-monotonic Inference Relations
- Using arguments for making and explaining decisions
- Weighted argument systems: basic definitions, algorithms, and complexity results
- Weighted argumentation for analysis of discussions in Twitter
Cited in
(7)- A QBF-based formalization of abstract argumentation semantics
- scientific article; zbMATH DE number 6928628 (Why is no real title available?)
- Reduced meet over labelling-based semantics in abstract argumentation
- An empirical and axiomatic comparison of ranking-based semantics for abstract argumentation
- Extension-based semantics for incomplete argumentation frameworks: properties, complexity and algorithms
- Towards a general theory of decomposability in abstract argumentation
- Theory of semi-instantiation in abstract argumentation
This page was built for publication: A general approach to extension-based semantics in abstract argumentation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2680804)