343 search results - page 22 / 69 » Purely Relational FLWORs |
SYNASC
2008
IEEE
14 years 1 months ago
2008
IEEE
We formalize paper fold (origami) by graph rewriting. Origami tion is abstractly described by a rewrite system (O, ), where set of abstract origami’s and is a binary relation on ...
ADC
2006
Springer
14 years 1 months ago
2006
Springer
We extend Fagin’s result on the equivalence between functional dependencies in relational databases and propositional Horn clauses. It is shown that this equivalence still holds...
BIRTHDAY
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. The Clio project provides tools that vastly simplify information integration. Information integration requires data conversions to bring data in different representation...
IASSE
2004
13 years 9 months ago
2004
Accurate demand forecasting remains difficult and challenging in today's competitive and dynamic business environment, but even a little improvement in demand prediction may ...
FUIN
2006
13 years 7 months ago
2006
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., vi...