Computing stable extensions of argumentation frameworks using formal concept analysis
From MaRDI portal
Publication:6545530
Recommendations
- A formal concept view of abstract argumentation
- An Algorithm for Computing Semi-stable Semantics
- On the computation of Top-k extensions in abstract argumentation frameworks
- scientific article; zbMATH DE number 1769206
- Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks
Cites work
- A fast algorithm for building lattices
- A formal concept view of abstract argumentation
- A hybrid and exploratory approach to knowledge discovery in metabolomic data
- Comparing performance of algorithms for generating concept lattices
- Computational models of argument (COMMA 2010). Proceedings of 3rd conference, Desanzano del Garda, Italy, September 2010.
- Concept Lattices
- Conceptual exploration
- Efficient mining of association rules based on formal concept analysis
- scientific article; zbMATH DE number 4016967 (Why is no real title available?)
- scientific article; zbMATH DE number 3604894 (Why is no real title available?)
- scientific article; zbMATH DE number 1249514 (Why is no real title available?)
- scientific article; zbMATH DE number 1827093 (Why is no real title available?)
- scientific article; zbMATH DE number 2243401 (Why is no real title available?)
- Learning implications from data and from queries
- On computing the size of a lattice and related decision problems
- On generating all maximal independent sets
- 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
- Two basic algorithms in concept analysis
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)
