Sciweavers

71 search results - page 12 / 15
» An Algebraic Framework for Schema Matching
Sort
View
ATAL
2007
Springer
14 years 27 days ago
Argumentation over ontology correspondences in MAS
In order to support semantic interoperation in open environments, where agents can dynamically join or leave and no prior assumption can be made on the ontologies to align, the di...
Loredana Laera, Ian Blacoe, Valentina A. M. Tamma,...
ACS
2008
13 years 6 months ago
Subobject Transformation Systems
Abstract Subobject transformation systems (sts) are proposed as a novel formal framework for the analysis of derivations of transformation systems based on the algebraic, double-pu...
Andrea Corradini, Frank Hermann, Pawel Sobocinski
SIGMOD
2006
ACM
159views Database» more  SIGMOD 2006»
14 years 6 months ago
Flexible and efficient XML search with complex full-text predicates
Recently, there has been extensive research that generated a wealth of new XML full-text query languages, ranging from simple Boolean search to combining sophisticated proximity a...
Sihem Amer-Yahia, Emiran Curtmola, Alin Deutsch
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 6 months ago
An Evidential Path Logic for Multi-Relational Networks
Multi-relational networks are used extensively to structure knowledge. Perhaps the most popular instance, due to the widespread adoption of the Semantic Web, is the Resource Descr...
Marko A. Rodriguez, Joe Geldart
POPL
2003
ACM
14 years 7 months ago
Pure patterns type systems
We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction applicatio...
Gilles Barthe, Horatiu Cirstea, Claude Kirchner, L...