Computing stable extensions of argumentation frameworks using formal concept analysis
type: Item
instance of: scholarly article
title: Computing stable extensions of argumentation frameworks using formal concept analysis
DOI: 10.1007/978-3-031-43619-2_13
author: Sergei Obiedkov
author: Barış Sertkaya
publication date: 2024-05-29T00:00:00Z
Mathematics Subject Classification ID: 68T27
zbMATH DE Number: 7855120
MaRDI profile type: Publication
cites work: A Formal Concept View of Abstract Argumentation
cites work: Q3160990
cites work: Probably approximately correct learning of Horn envelopes from queries
cites work: Q3029054
cites work: Q5715718
cites work: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
cites work: Two Basic Algorithms in Concept Analysis
cites work: Conceptual Exploration
cites work: Q4230685
cites work: A hybrid and exploratory approach to knowledge discovery in metabolomic data
cites work: On generating all maximal independent sets
cites work: On computing the size of a lattice and related decision problems
cites work: Concept Lattices
cites work: Comparing performance of algorithms for generating concept lattices
cites work: Q5493143
cites work: Q4170725
cites work: A fast algorithm for building lattices
cites work: Learning implications from data and from queries
cites work: Q4781231
description: scientific article; zbMATH DE number 7855120