Sciweavers

3001 search results - page 184 / 601
» Recursive type generativity
Sort
View
CAV
2007
Springer
212views Hardware» more  CAV 2007»
15 years 10 months ago
A Tutorial on Satisfiability Modulo Theories
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...
Leonardo Mendonça de Moura, Bruno Dutertre,...
TSD
2000
Springer
15 years 10 months ago
A Word Analysis System for German Hyphenation, Full Text Search, and Spell Checking, with Regard to the Latest Reform of German
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...
Gabriele Kodydek
DBPL
2005
Springer
93views Database» more  DBPL 2005»
15 years 8 months ago
On the Expressive Power of XQuery Fragments
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...
IJCAI
1997
15 years 7 months ago
Efficiently Executing Information-Gathering Plans
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...
Marc Friedman, Daniel S. Weld
IS
2008
15 years 6 months ago
On the expressibility of functions in XQuery fragments
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...