Representing lattices using many-valued relations
From MaRDI portal
Publication:2390385
DOI10.1016/j.ins.2009.03.018zbMath1176.06004OpenAlexW1967637206MaRDI QIDQ2390385
Lhouari Nourine, Alain Gély, Raoul Median
Publication date: 22 July 2009
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2009.03.018
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Attribute reduction in decision-theoretic rough set models
- Concept analysis via rough set and AFS algebra
- Relations and functions in multiset context
- A fast algorithm for building lattices
- Maximal and stochastic Galois lattices
- Concept lattices and order in fuzzy logic
- Variable threshold concept lattices
- A decomposition theorem for partially ordered sets
- Two Basic Algorithms in Concept Analysis
- On the Structure of Armstrong Relations for Functional Dependencies
- The Factorization and Representation of Lattices
- Comparing performance of algorithms for generating concept lattices