654 search results - page 19 / 131 » Ordered Sets and Complete Lattices |
ICFCA
2009
Springer
14 years 2 months ago
2009
Springer
Formal concept analysis (FCA) is increasingly applied to data mining problems, essentially as a formal framework for mining reduced representations (bases) of target pattern famili...
MSCS
2007
13 years 7 months ago
2007
It is well-known that weakening and contraction cause na¨ıve categorical models of the classical sequent calculus to collapse to Boolean lattices. In previous work, summarized b...
SIBGRAPI
2005
IEEE
14 years 1 months ago
2005
IEEE
Mathematical morphology was originally conceived as a set theoretic approach for the processing of binary images. Approaches that extend classical binary morphology to gray-scale ...
IJCM
2002
13 years 7 months ago
2002
In this paper we focus on the representation of Steiner trades of volume less than or equal to nine and identify those for which the associated partial latin square can be decompos...
DALT
2005
Springer
14 years 1 months ago
2005
Springer
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...