Information systems for continuous posets
Theoretical Computer Science
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
ICFCA'07 Proceedings of the 5th international conference on Formal concept analysis
Robust Elements in Rough Set Abstractions
ICFCA '09 Proceedings of the 7th International Conference on Formal Concept Analysis
P-products for selection of ship designers
E-ACTIVITIES'09/ISP'09 Proceedings of the 8th WSEAS International Conference on E-Activities and information security and privacy
MATH'09 Proceedings of the 14th WSEAS International Conference on Applied mathematics
Order ideals of a quasi-ordered set and graywater
ACMOS'10 Proceedings of the 12th WSEAS international conference on Automatic control, modelling & simulation
ICFCA'11 Proceedings of the 9th international conference on Formal concept analysis
Non-symmetric indiscernibility
KONT'07/KPP'07 Proceedings of the First international conference on Knowledge processing and data analysis
Approximations in concept lattices
ICFCA'10 Proceedings of the 8th international conference on Formal Concept Analysis
On links between concept lattices and related complexity problems
ICFCA'10 Proceedings of the 8th international conference on Formal Concept Analysis
Review: Formal Concept Analysis in knowledge processing: A survey on models and techniques
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
We show how certain lattices occurring in the theory of Rough Sets can be described in the language of Formal Concept Analysis. These lattices are obtained from generalised approximation operators forming a kernel-closure pair. We prove a general context representation theorem and derive first consequences. It becomes clear under which conditions the approximations can be interpreted as intervals in a lattice of "definable sets".