Sciweavers

2145 search results - page 89 / 429
» Lax Logical Relations
Sort
View
IFIPTCS
2010
13 years 8 months ago
A Logic on Subobjects and Recognizability
We introduce a simple logic that allows to quantify over the subobjects of a categorical object. We subsequently show that, for the category of graphs, this logic is equally expres...
Harrie Jan Sander Bruggink, Barbara König
WWW
2007
ACM
14 years 11 months ago
XML design for relational storage
Design principles for XML schemas that eliminate redundancies and avoid update anomalies have been studied recently. Several normal forms, generalizing those for relational databa...
Solmaz Kolahi, Leonid Libkin
ICDE
2004
IEEE
179views Database» more  ICDE 2004»
14 years 11 months ago
CrossMine: Efficient Classification Across Multiple Database Relations
Most of today's structured data is stored in relational databases. Such a database consists of multiple relations which are linked together conceptually via entity-relationsh...
Xiaoxin Yin, Jiawei Han, Jiong Yang, Philip S. Yu
DBPL
1995
Springer
106views Database» more  DBPL 1995»
14 years 1 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»
13 years 10 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