Sciweavers

2138 search results - page 217 / 428
» Logical Step-Indexed Logical Relations
Sort
View
DBPL
1995
Springer
106views Database» more  DBPL 1995»
15 years 10 months ago
On Impossibility of Decremental Recomputation of Recursive Queries in Relational Calculus and SQL
We study the problem of maintaining recursively-de ned views, such as the transitive closure of a relation, in traditional relational languages that do not have recursion mechanis...
Guozhu Dong, Leonid Libkin, Limsoon Wong
CORR
2006
Springer
100views Education» more  CORR 2006»
15 years 6 months ago
Pivotal and Pivotal-discriminative Consequence Relations
In the present paper, we investigate consequence relations that are both paraconsistent and plausible (but still monotonic). More precisely, we put the focus on pivotal consequenc...
Jonathan Ben-Naim
DEXA
2009
Springer
151views Database» more  DEXA 2009»
16 years 1 months ago
Automatic Extraction of Ontologies Wrapping Relational Data Sources
Describing relational data sources (i.e. databases) by means of ontologies constitutes the foundation of most of the semantic based approaches to data access and integration. In sp...
Lina Lubyte, Sergio Tessaris
ICDT
2010
ACM
195views Database» more  ICDT 2010»
15 years 10 months ago
Answering Non-Monotonic Queries in Relational Data Exchange
Relational data exchange deals with translating a relational database instance over some source schema into a relational database instance over some target schema, according to a ...
André Hernich
JOLLI
2008
95views more  JOLLI 2008»
15 years 6 months ago
Relational Modality
Saul Kripke's thesis that ordinary proper names are rigid designators is supported by widely shared intuitions about the occurrence of names in ordinary modal contexts. By th...
Kathrin Glüer, Peter Pagin