On searching explanatory argumentation graphs
type: Item
instance of: scholarly article
title: On searching explanatory argumentation graphs
zbMATH Open document ID: 1486.68185
DOI: 10.1080/11663081.2020.1766248
author: Régis Riveret
published in: Journal of Applied Non-Classical Logics
publication date: 2021-06-25T00:00:00Z
Mathematics Subject Classification ID: 68T27
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68T30
zbMATH DE Number: 7363451
zbMATH Keywords: explainable artificial intelligence
zbMATH Keywords: argumentation frameworks
zbMATH Keywords: probabilistic argumentation
MaRDI profile type: MaRDI publication profile
full work available at URL: https://doi.org/10.1080/11663081.2020.1766248
OpenAlex ID: W3033232851
cites work: A general semi-structured formalism for computational argumentation: definition, properties, and examples of application
cites work: Q4576188
cites work: Enhancing Statement Evaluation in Argumentation via Multi-labelling Systems
cites work: Q3457206
cites work: Argumentation in artificial intelligence
cites work: A model of legal reasoning with cases incorporating theories and values
cites work: A possible world view and a normal form for the constellation semantics
cites work: Bipolarity in argumentation graphs: towards a better understanding
cites work: A Translation-Based Approach for Revision of Argumentation Frameworks
cites work: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
cites work: Closure and consistency in logic-associated argumentation
cites work: Characteristics of multiple viewpoints in abstract argumentation
cites work: Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence
cites work: Handbook of metaheuristics
cites work: Q3510469
cites work: A probabilistic approach to modelling uncertain logical arguments
cites work: Probabilistic Reasoning with Abstract Argumentation Frameworks
cites work: Q3655273
cites work: Depth-first iterative-deepening: An optimal admissible tree search
cites work: Q4576179
cites work: Modelling Argument Accrual in Possibilistic Defeasible Logic Programming
cites work: Argument based machine learning
cites work: Synthesizing Argumentation Frameworks from Examples
cites work: A defeasible reasoning model of inductive concept learning from examples and communication
cites work: Empirical evaluation of abstract argumentation: supporting the need for bipolar and probabilistic approaches
cites work: Q5283034
cites work: A formalization of argumentation schemes for legal case-based reasoning in ASPIC+
cites work: Markov logic networks
cites work: A labelling framework for probabilistic argumentation
cites work: Abstract argumentation and explanation applied to scientific debates
description: scientific article; zbMATH DE number 7363451