ICFCA
2010
Springer
14 years 7 months 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
2010
Springer
14 years 7 months 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
2010
Springer
14 years 7 months 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...
1
posts
with
545
views
545
views
Homepage SIGMOD
2008
ACM
15 years 29 days ago
2008
ACM
We present SchemaScope, a system to derive Document Type Definitions and XML Schemas from corpora of sample XML documents. Tools are provided to visualize, clean, and refine exist...
100
click to vote
PODS
2009
ACM
15 years 1 months ago
2009
ACM
For many years, finite model theory was viewed as the backbone of database theory, and database theory in turn supplied finite model theory with key motivations and problems. By n...