Computing stable extensions of argumentation frameworks using formal concept analysis
From MaRDI portal
Publication:6545530
DOI10.1007/978-3-031-43619-2_13MaRDI QIDQ6545530
Barış Sertkaya, Sergei Obiedkov
Publication date: 29 May 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On generating all maximal independent sets
- A fast algorithm for building lattices
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- Probably approximately correct learning of Horn envelopes from queries
- A hybrid and exploratory approach to knowledge discovery in metabolomic data
- Learning implications from data and from queries
- Conceptual Exploration
- Two Basic Algorithms in Concept Analysis
- Comparing performance of algorithms for generating concept lattices
- A Formal Concept View of Abstract Argumentation
- Concept Lattices
- On computing the size of a lattice and related decision problems
This page was built for publication: Computing stable extensions of argumentation frameworks using formal concept analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6545530)
