234 search results - page 22 / 47 » Rough Set Approximations in Formal Concept Analysis |
CAV
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In predicate abstraction, exact image computation is problematic, requiring in the worst case an exponential number of calls to a decision procedure. For this reason, sof...
GIS
1999
ACM
13 years 12 months ago
1999
ACM
: The paper is concerned with the effective and efficient processing of spatiotemporal selection queries under varying degrees of approximation. Such queries may employ operators l...
SWAP
2007
13 years 8 months ago
2007
We address the problem of reasoning with instances of heterogeneously formalized ontologies. Given a set of semantic mappings, reconciling conceptual and instance level heterogenei...
KCAP
2005
ACM
14 years 1 months ago
2005
ACM
Among the variety of alignment approaches (e.g., using machine learning, subsumption computation, formal concept analysis, etc.) similarity-based ones rely on a quantitative asses...
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Typical ontology matching applications, such as ontology integration, focus on the computation of correspondences holding between the nodes of two graph-like structures, ...