Abstract. Solvers for satisfiability modulo theories (SMT) check the satisfiability of first-order formulas containing operations from various theories such as the Booleans, bit-ve...
In text processing systems German words require special treatment because of the possibility to form compound words as a combination of existing words. To this end, a universal wor...
XQuery is known to be a powerful XML query language with many bells and whistles. For many common queries we do not need all the expressive power of XQuery. We investigate the eff...
Jan Hidders, Stefania Marrara, Jan Paredaens, Roel...
Themost costly aspect of gathering information over the Internet is that of transferring data over the networkto answer the user’s query. Wemaketwo contributions in this paperth...
XQuery is a powerful XML query language with many features and syntactic constructs. For many common queries we do not need all the expressive power of XQuery. We investigate the ...
Jan Hidders, Stefania Marrara, Jan Paredaens, Roel...