Various characterizations of finite convex geometries
are well known. This note provides similar characterizations for
possibly infinite convex geometries whose lattice of closed sets is
strongly coatomic and lower ...
Discovery of (strong) association rules, or implications, is an important
task in data management, and it nds application in arti cial intelligence,
data mining and the semantic web. We introduce a novel approach
for ...
Part I proved that for every quasivariety K of structures
(which may have both operations and relations) there is a semilattice
S with operators such that the lattice of quasi-equational theories of
K (the dual of the ...
We show that every optimum basis of a nite closure system,
in D. Maier's sense, is also right-side optimum, which is a parameter of a
minimum CNF representation of a Horn Boolean function. New parameters
for the size ...
Closure system on a nite set is a unifying concept in logic programming,
relational data bases and knowledge systems. It can also be presented
in the terms of nite lattices, and the tools of economic description of a
...
Submission guide