ICFCA
14 years 12 days ago
2010 Springer 
Let L → H be a lattice homomorphism and let a “readable” drawing of H be given. It is natural to make use of it to try getting a clear(er) drawing of L. Hence, the following ...
ICFCA
14 years 2 days ago
2010 Springer
Abstract. In the past years Software Engineering has experienced several difficulties in modularising crosscutting aspects, like shared, dynamic or scattered behavior of object-ori...
ICFCA
14 years 12 days ago
2010 Springer
We investigate the complexity of enumerating pseudo-intents in the lectic order. We look at the following decision problem: Given a formal context and a set of n pseudo-intents det...
ICFCA
14 years 12 days ago
2010 Springer
Concept lattices built on noisy data tend to be large and hence hard to interpret. We introduce several measures that can be used in selecting relevant concepts and discuss how the...
ICFCA
14 years 12 days ago
2010 Springer 
This paper is the successor to two previous papers published at the ICFCA conference. In the first paper we have shown that in the Description Logics EL and ELgfp, the set of gene...
|
Formal Methods