Abstract. Logic preservation theorems often have the form of a syntax/semantics correspondence. For example, the Los-Tarski theorem asserts that a rst-order sentence is preserved b...
—“Ontology matching” is the process of finding correspondences between entities belonging to different ontologies. This paper describes a set of algorithms that exploit uppe...
Schema matching is a crucial task to gather information of the same domain. This is more true on the web, where a large number of data sources are available and require to be matc...
Document representation and indexing is a key problem for document analysis and processing, such as clustering, classification and retrieval. Conventionally, Latent Semantic Index...
The web-services stack of standards is designed to support the reuse and interoperation of software components on the web. A critical step in the process of developing applications...