Sciweavers

650 search results - page 25 / 130
» On Coalgebras over Algebras
Sort
View
ICDT
2009
ACM
108views Database» more  ICDT 2009»
14 years 8 months ago
A compositional query algebra for second-order logic and uncertain databases
World-set algebra is a variable-free query language for uncertain databases. It constitutes the core of the query language implemented in MayBMS, an uncertain database system. Thi...
Christoph Koch
DAM
2008
125views more  DAM 2008»
13 years 7 months ago
Heyting algebras with Boolean operators for rough sets and information retrieval applications
This paper presents an algebraic formalism for reasoning on finite increasing sequences over Boolean algebras in general and on generalizations of Rough Set concepts in particular...
Eric SanJuan
ENTCS
2002
143views more  ENTCS 2002»
13 years 7 months ago
Collecting Statistics over Runtime Executions
Abstract. We present an extension to linear-time temporal logic (LTL) that combines the temporal specification with the collection of statistical data. By collecting statistics ove...
Bernd Finkbeiner, Sriram Sankaranarayanan, Henny S...
CSL
2008
Springer
13 years 9 months ago
Characterization of Logics over Ranked Tree Languages
We study the expressive power of the logics EF + F-1 , 2 and boolean combinations of 1 over ranked trees. In particular, we provide effective characterizations of those three logic...
Thomas Place
CORR
2004
Springer
117views Education» more  CORR 2004»
13 years 7 months ago
Efficient dot product over word-size finite fields
We want to achieve efficiency for the exact computation of the dot product of two vectors over word size finite fields. We therefore compare the practical behaviors of a wide range...
Jean-Guillaume Dumas