Sciweavers

91 search results - page 8 / 19
» Approximation of Ontologies in CASL
Sort
View
CONTEXT
2007
Springer
15 years 3 months ago
Contexts and Ontologies in Schema Matching
Abstract. In this paper, we propose a general model of schema matching based on the following ideas: on the one hand, a schema is viewed as a context (namely as a partial and appro...
Paolo Bouquet
KCAP
2009
ACM
15 years 2 months ago
An entropy inspired measure for evaluating ontology modularization
Ontology modularization has received growing interest from the research community lately, since it supports tasks such as ontology design/reuse and knowledge selection and integra...
Paul Doran, Valentina A. M. Tamma, Terry R. Payne,...
AAAI
2007
14 years 12 months ago
Partial Matchmaking using Approximate Subsumption
Description Logics, and in particular the web ontology language OWL has been proposed as an appropriate basis for computing matches between structured objects for the sake of info...
Heiner Stuckenschmidt
63
Voted
POLICY
2005
Springer
15 years 3 months ago
Approximating Service Utility from Policies and Value Function Patterns
Service-oriented computing provides the right means for building flexible systems that allow dynamic configuration and on-the-fly composition. In order to realize this vision, ...
Steffen Lamparter, Daniel Oberle, Andreas Eberhart
65
Voted
SEMWEB
2009
Springer
15 years 4 months ago
Recommendations for Qualitative Ontology Matching Evaluations
This paper suggests appropriate rules to set up ontology matching evaluations and for golden standard construction and use which can significantly improve the quality of the preci...
Aliaksandr Autayeu, Vincenzo Maltese, Pierre Andre...