DM
2002
13 years 11 months ago
2002
Some recent results provide su cient conditions for complete lattices of closure operators on complete lattices, ordered pointwise, to be pseudocomplemented. This paper gives resu...
IANDC
2007
13 years 11 months ago
2007
In this paper we study secure information flow policies in the sense of Meadows [12] and others for aggregated datasets, collectively. We first present a method for combining di...
DAGSTUHL
2006
14 years 29 days ago
2006
We present a model of causality which is defined by the intersection of two distinct closure systems, I and T . To present empirical evidence to demonstrate that this model has pra...
IJCAI
2007
14 years 1 months ago
2007
Motivated by basic ideas from formal concept analysis, we propose two ways to directly encode closure operators on finite sets in a 3-layered feed forward neural network.