Characterizing acceptability semantics of argumentation frameworks with recursive attack and support relations
type: Item
instance of: scholarly article
title: Characterizing acceptability semantics of argumentation frameworks with recursive attack and support relations
zbMATH Open document ID: 1451.68262
author: Sebastian Gottifredi
author: Andrea Cohen
author: Guillermo R. Simari
author: Alejandro J. García
published in: Artificial Intelligence
publication date: 2019-01-18T00:00:00Z
Mathematics Subject Classification ID: 68T27
zbMATH DE Number: 7003572
zbMATH Keywords: abstract argumentation
zbMATH Keywords: bipolar argumentation
zbMATH Keywords: recursive interactions
zbMATH Keywords: acceptability semantics
describes a project that uses: AFRA
describes a project that uses: DIAMOND
MaRDI profile type: Publication
Wikidata QID: Q110528573
full work available at URL: j.artint.2018.06.008
OpenAlex ID: W2816362554
cites work: Abductive Reasoning on Molecular Interaction Maps
cites work: A reasoning model based on the production of acceptable arguments
cites work: Using arguments for making and explaining decisions
cites work: Encompassing Attacks to Attacks in Abstract Argumentation Frameworks
cites work: AFRA: argumentation framework with recursive attacks
cites work: Argumentation in artificial intelligence
cites work: A logic-based theory of deductive arguments
cites work: An abstract, argumentation-theoretic approach to default reasoning
cites work: A logical account of formal argumentation
cites work: Argumentation frameworks with recursive attacks and evidence-based supports
cites work: Symbolic and Quantitative Approaches to Reasoning with Uncertainty
cites work: Bipolarity in argumentation graphs: towards a better understanding
cites work: An Axiomatic Approach to Support in Argumentation
cites work: Computing Preferred Extensions in Abstract Argumentation: A SAT-Based Approach
cites work: An approach to abstract argumentation with recursive attack and support
cites work: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
cites work: Computing ideal sceptical argumentation
cites work: An approach to decision making based on dynamic argumentation systems
cites work: Defeasible logic programming: an argumentative approach
cites work: Arguing about informant credibility in open multi-agent systems
cites work: Reaching agreements through argumentation: a logical model and implementation
cites work: Reasoning about preferences in argumentation frameworks
cites work: A Generalization of Dung’s Abstract Framework for Argumentation: Arguing with Sets of Attacking Arguments
cites work: Understanding the Abstract Dialectical Framework
cites work: Q5283034
cites work: Law and logic: a review from an argumentation perspective
cites work: A mathematical treatment of defeasible reasoning and its implementation.
cites work: Arguing about the Trustworthiness of the Information Sources
cites work: Modelling defeasible and prioritized support in bipolar argumentation
DOI: 10.1016/J.ARTINT.2018.06.008
description: scientific article; zbMATH DE number 7003572