Sciweavers

2432 search results - page 119 / 487
» Cryptographic logical relations
Sort
View
DAGSTUHL
2003
15 years 6 months ago
Query Answering in Inconsistent Databases
In this chapter, we summarize the research on querying inconsistent databases we have been conducting over the last five years. The formal framework we have used is based on two c...
Leopoldo E. Bertossi, Jan Chomicki
AAAI
1996
15 years 6 months ago
Splitting a Default Theory
This paper presents mathematical results that can sometimes be used to simplify the task of reasoning about a default theory, by \splitting it into parts." These so-called Sp...
Hudson Turner
CORR
2004
Springer
97views Education» more  CORR 2004»
15 years 4 months ago
The semijoin algebra and the guarded fragment
In the 1970s Codd introduced the relational algebra, with operators selection, projection, union, difference and product, and showed that it is equivalent to first-order logic. In ...
Dirk Leinders, Jerzy Tyszkiewicz, Jan Van den Buss...
ADC
2004
Springer
87views Database» more  ADC 2004»
15 years 10 months ago
On the Computation of Approximations of Database Queries
Reflective Relational Machines were introduced by S. Abiteboul, C. Papadimitriou and V. Vianu in 1994, as variations of Turing machines which are suitable for the computation of ...
Flavio Antonio Ferrarotti, Jose Maria Turull Torre...
ICDT
2007
ACM
97views Database» more  ICDT 2007»
15 years 10 months ago
Combining Temporal Logics for Querying XML Documents
Close relationships between XML navigation and temporal logics have been discovered recently, in particular between logics LTL and CTL⋆ and XPath navigation, and between the µ-c...
Marcelo Arenas, Pablo Barceló, Leonid Libki...