Graded labellings for abstract argumentation
type: Item
instance of: scholarly article
title: Graded labellings for abstract argumentation
zbMATH Open document ID: 1505.68040
author: Lixing Tan
author: Zhaohui Zhu
author: Jinjin Zhang
author: Fu Jun Wang
published in: International Journal of Approximate Reasoning
publication date: 2022-12-08T00:00:00Z
Mathematics Subject Classification ID: 68T27
Mathematics Subject Classification ID: 68T37
zbMATH DE Number: 7629295
zbMATH Keywords: abstract argumentation
zbMATH Keywords: graded labellings
zbMATH Keywords: representation theorems
MaRDI profile type: Publication
full work available at URL: j.ijar.2022.10.009
OpenAlex ID: W4306812360
cites work: Argumentation in artificial intelligence
cites work: Design and results of the second international competition on computational models of argumentation
cites work: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
cites work: Law and logic: a review from an argumentation perspective
cites work: Using arguments for making and explaining decisions
cites work: Argument based machine learning
cites work: Weighted argumentation for analysis of discussions in Twitter
cites work: A comprehensive study of argumentation frameworks with sets of attacking arguments
cites work: Labellings for assumption-based and abstract argumentation
cites work: A Labelling Semantics and Strong Admissibility for Weighted Argumentation Frameworks
cites work: On the Issue of Reinstatement in Argumentation
cites work: A logical account of formal argumentation
cites work: On the graded acceptability of arguments in abstract and instantiated argumentation
cites work: An approach to characterize graded entailment of arguments through a label-based framework
cites work: A logic-based theory of deductive arguments
cites work: Q5715696
cites work: Weighted argument systems: basic definitions, algorithms, and complexity results
cites work: Evaluation of argument strength in attack graphs: foundations and semantics
cites work: Algorithms for decision problems in argument systems under preferred semantics
cites work: Algorithms for Argumentation Semantics: Labeling Attacks as a Generalization of Labeling Arguments
cites work: Looking-ahead in backtracking algorithms for abstract argumentation
cites work: How we designed winning algorithms for abstract argumentation and which insight we attained
cites work: On a generalization of quantifiers
cites work: An abstract, argumentation-theoretic approach to default reasoning
cites work: Semi-stable semantics
cites work: Methods for solving reasoning problems in abstract argumentation -- a survey
cites work: On the responsibility for undecisiveness in preferred and stable labellings in abstract argumentation
cites work: Continuous Lattices and Domains
cites work: Parametric properties of ideal semantics
cites work: Computing ideal sceptical argumentation
DOI: 10.1016/J.IJAR.2022.10.009
description: scientific article; zbMATH DE number 7629295