Closure systems (ie families of subsets of a set S containing S and closed by set
intersection) or, equivalently, closure operators and full implicational systems appear in …

The notion of dependencies between “attributes” arises in many areas such as relational
databases, data analysis, data-mining, formal concept analysis, knowledge structures …

Abstract Concept lattices and closed set lattices are graphs with the lattice property. They
have been increasingly used this last decade in various domains of computer science, such …

In this paper, a method for computing the closure of a set of attributes according to a
specification of functional dependencies of the relational model is described. The main …

In the last years, the main orientation of Formal Concept Analysis (FCA) has turned from
mathematics towards computer science. This article provides a review of this new orientation …

The joy of implications, aka pure Horn formulas: Mainly a survey - ScienceDirect Skip to main
contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF …

Attribute-incremental construction of the canonical implication basis Page 1 Ann Math Artif Intell
(2007) 49:77–99 DOI 10.1007/s10472-007-9057-2 Attribute-incremental construction of the …

The closure system on a finite set is a unifying concept in logic programming, relational
databases and knowledge systems. It can also be presented in the terms of finite lattices …

In rough set theory (RST), the notion of decision table plays a fundamental role. In this
paper, we develop a purely mathematical investigation of this notion to show that several …

Implications of a formal context obey Armstrong rules, which allows one to define a minimal
(in the number of implications) implication basis, called Duquenne–Guigues basis or stem …