Sciweavers

6 search results - page 1 / 2
» GROM: a General Rewriter of Semantic Mappings
Sort
View
CORR
2006
Springer
117views Education» more  CORR 2006»
13 years 4 months ago
A comparison between two logical formalisms for rewriting
Meseguer's rewriting logic and the rewriting logic CRWL are two well-known approaches to rewriting as logical deduction that, despite some clear similarities, were designed w...
Miguel Palomino
APN
2001
Springer
13 years 8 months ago
Rewriting Logic as a Unifying Framework for Petri Nets
We propose rewriting logic as a unifying framework for a wide range of Petri nets models. We treat in detail place/transition nets and important extensions of the basic model by in...
Mark-Oliver Stehr, José Meseguer, Peter Csa...
AICOM
2004
100views more  AICOM 2004»
13 years 4 months ago
Query rewriting with symmetric constraints
Abstract. We address the problem of answering queries using expressive symmetric inter-schema constraints which allow to establish mappings between several heterogeneous informatio...
Christoph Koch
VLDB
2001
ACM
151views Database» more  VLDB 2001»
14 years 4 months ago
Approximate query mapping: Accounting for translation closeness
Abstract In this paper we present a mechanism for approximately translating Boolean query constraints across heterogeneous information sources. Achieving the best translation is ch...
Kevin Chen-Chuan Chang, Hector Garcia-Molina
ESWS
2008
Springer
13 years 6 months ago
Viewing and Querying Topic Maps in terms of RDF
Both Topic Maps and RDF are popular semantic web standards designed for machine processing of web documents. Since these representations were originally created for different purpo...
Silvia Stefanova, Tore Risch