LATA
2009
Springer
13 years 11 months ago
2009
Springer
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
ICFCA
2009
Springer
13 years 11 months ago
2009
Springer
ICFCA
2009
Springer
13 years 11 months ago
2009
Springer
ICFCA
2009
Springer
13 years 11 months ago
2009
Springer
Matrix decomposition methods provide representations of an object-variable data matrix by a product of two different matrices, one describing relationship between objects and hidd...
ICFCA
2009
Springer
13 years 11 months ago
2009
Springer
In knowledge representation and reasoning systems, diagrams have many practical applications and are used in numerous settings. Indeed, it is widely accepted that diagrams are a va...
ICFCA
2009
Springer
13 years 11 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...
ICFCA
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. In a previous paper, we have introduced an approach for extending both the terminological and the assertional part of a Description Logic knowledge base by using informat...
ICFCA
2009
Springer
13 years 11 months ago
2009
Springer
This paper revisits the lattice-based thesaurus models which Margaret Masterman used for machine translation in the 1950’s and 60’s. Masterman’s notions are mapped onto moder...
ICFCA
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. In a previous ICFCA paper we have shown that, in the Description Logics EL and ELgfp, the set of general concept inclusions holding in a finite model always has a finit...
ICFCA
2010
Springer
13 years 11 months 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...