343 search results - page 37 / 69 » Purely Relational FLWORs |
APAL
2010
13 years 8 months ago
2010
Classical proof forests are a proof formalism for first-order classical logic based on Herbrand's Theorem and backtracking games in the style of Coquand. First described by M...
APAL
2008
13 years 8 months ago
2008
We extend the earlier results on the equivalence between the Boolean and the multivalued dependencies in relational databases and fragments of the Boolean propositional logic. It ...
JSW
2008
13 years 8 months ago
2008
We use audited financial statements to examine claims that service-oriented architecture (SOA) leads to higher profits relative to traditional software delivery models. Specificall...
HASKELL
2009
ACM
14 years 3 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
CIKM
2009
Springer
14 years 20 days ago
2009
Springer
The XML support in relational databases and the SQL/XML language are still relatively new as compared to purely relational databases and traditional SQL. Today, most database user...