[
1. Armstrong, W. W. Dependency Structures of Data Base Relationships. – Information Processing, Vol. 74, 1974, pp. 580-583.10.1515/9783110840308-026
]Search in Google Scholar
[
2. Berge, C. Hypergraphs: Combinatorics of Finite Sets. Amsterdam, North-Holland, 1989.
]Search in Google Scholar
[
3. Bertet, K., C. Demko, J. Viaud, C. Guéri. Lattices, Closures Systems and Implication Bases: A Survey of Structural Aspects and Algorithms. – In: Theoretical Computer Science. Vol. 743. 2018, pp. 93-109.10.1016/j.tcs.2016.11.021
]Search in Google Scholar
[
4. Caspard, N., B. Monjardet. The Lattices of Closure Systems, Closure Operators, and Implicational Systems on a Finite Set: A Survey. – Discrete Applied Mathematics, Vol. 127, 2003, No 2, pp. 241-269.10.1016/S0166-218X(02)00209-3
]Search in Google Scholar
[
5. Demetrovics, J. Logical and Structural Study of a Relational Data Model (in Hungarian). – MTASZTAKI Tanulmanyok Budapest, Vol. 114, 1980, pp. 1-97.
]Search in Google Scholar
[
6. Demetrovics, J., N. X. Hu y, Closed Sets and Translations of Relation Schemes, Hungarian Applied Mathematics. – Comput. Math. Appl., Vol. 21, 1991, No 1, pp. 13-23.10.1016/0898-1221(91)90227-U
]Search in Google Scholar
[
7. Demetrovics, J., G. Hencsey, L. Libkin, I. Muchnik. On the Interaction between Closure Operations and Choice Functions with Applications to Relational Databases. – Acta Cybernetica, Vol. 10, 1992, No 3, pp. 129-139.
]Search in Google Scholar
[
8. Demetrovics, J., L. Libkin, I. B. Muchnik. Functional Dependencies in Relational Databases: A Lattice Point of View. – Discrete Applied Mathematics, Vol. 40, 1992, No 2, pp. 155-185.10.1016/0166-218X(92)90028-9
]Search in Google Scholar
[
9. Demetrovics, J., V. D. Th i. Describing Candidate Keys by Hypergraphs. – Computers and Artificial Intelligence, Vol. 18, 1999, No 2, pp. 191-207.
]Search in Google Scholar
[
10. Demetrovics, J., V. D. Thi, N. L. Giang. On Finding All Reducts of Consistent Decision Tables. – Cybernetics and Information Technologies, Vol. 14, 2014, No 4, pp. 3-10.10.1515/cait-2014-0001
]Search in Google Scholar
[
11. Demetrovics, J., V. D. Thi, N. L. Giang. An Efficient Algorithm for Determining the Set of All Reductive Attributes in Incomplete Decision Tables. – Cybernetics and Information Technologies, Vol. 13, 2013, No 4, pp. 118-126.10.2478/cait-2013-0058
]Search in Google Scholar
[
12. Giang, N. L., J. Demetrovics, V. D. Thi, P. D. Khoa. Some Properties Related to Reduct of Consistent Decision Systems, – Cybernetics and Information Technologies, Vol. 21, 2021, No 2, pp. 3-9.10.2478/cait-2021-0015
]Search in Google Scholar
[
13. Mao, H., S. Liu. Posets and Closure Operators Relative to Matroids. – Matematika, 2012, No 1, pp. 77-85.
]Search in Google Scholar
[
14. Narayanamoorthy, S., A. T a m i l s e l v i. Bipolar Fuzzy Line Graph of a Bipolar Fuzzy Hypergraph. – Cybernetics and Information Technologies, Vol. 13, 2013, No 1, pp. 13-17.10.2478/cait-2013-0002
]Search in Google Scholar
[
15. Nghia, V. D. Relationships between Closure Operations and Choice Functions Equivalent Descriptions of a Family of Functional Dependencies. – Acta Cybernetica, Vol. 16, 2004, No 3, pp. 485-506.
]Search in Google Scholar
[
16. Son, N. H., V. D. Th i. Some Combinatorial Characteristics of Closure Operations. – Algebra and Discrete Mathematics, Vol. 28, 2019, No 1, pp. 144-156.
]Search in Google Scholar
[
17. Son, N. H., V. D. Thi. Some Results Related to Dense Families of Database Relations. – Acta Cybernetica, Vol. 17, 2005, No 1, pp. 173-182.
]Search in Google Scholar
[
18. Thi, V. D. Minimal Keys and Antikeys. – Acta Cybernetica, Vol. 7, 1986, No 4, pp. 361-371.
]Search in Google Scholar
