Sciweavers

1586 search results - page 130 / 318
» Semantic Schema Matching
Sort
View
ICDT
2012
ACM
247views Database» more  ICDT 2012»
13 years 6 months ago
A normal form for preventing redundant tuples in relational databases
We introduce a new normal form, called essential tuple normal form (ETNF), for relations in a relational database where the constraints are given by functional dependencies and jo...
Hugh Darwen, C. J. Date, Ronald Fagin
NDJFL
2000
79views more  NDJFL 2000»
15 years 4 months ago
An Information-Based Theory of Conditionals
We present an approach to combining three areas of research which we claim are all based on information theory: knowledge representation in Artificial Intelligence and Cognitive Sc...
Wayne Wobcke
ECOWS
2004
Springer
15 years 8 months ago
Coupled Signature and Specification Matching for Automatic Service Binding
Abstract. Matching of semantic service descriptions is the key to automatic service discovery and binding. Existing approaches split the matchmaking process in two step: signature ...
Michael Klein, Birgitta König-Ries
CORR
2000
Springer
84views Education» more  CORR 2000»
15 years 4 months ago
Using a Diathesis Model for Semantic Parsing
This paper presents a semantic parsing approach for non domain-specific texts. Semantic parsing is one of the major bottlenecks of Natural Language Understanding (NLU) systems and...
Jordi Atserias, Irene Castellón, Montse Civ...
EKAW
2006
Springer
15 years 8 months ago
Matching Unstructured Vocabularies Using a Background Ontology
Existing ontology matching algorithms use a combination of lexical and structural correspondance between source and target ontologies. We present a realistic case-study where both ...
Zharko Aleksovski, Michel C. A. Klein, Warner ten ...