293 search results - page 48 / 59 » Regular languages and their generating functions: The invers... |
DBPL
1995
Springer
13 years 11 months ago
1995
Springer
We study the problem of maintaining recursively-de ned views, such as the transitive closure of a relation, in traditional relational languages that do not have recursion mechanis...
ICDT
2010
ACM
14 years 4 months ago
2010
ACM
Sources of data uncertainty and imprecision are numerous. A way to handle this uncertainty is to associate probabilistic annotations to data. Many such probabilistic database mode...
ICSM
2008
IEEE
14 years 1 months ago
2008
IEEE
Annotations are often mentioned as a potential alternative to tackle the fragile nature of AspectJ pointcuts. However, annotations themselves can be considered crosscutting elemen...
ICLP
2007
Springer
14 years 1 months ago
2007
Springer
aa We consider the problem of obtaining a minimal logic program strongly equivalent (under the stable models semantics) to a given arbitrary propositional theory. We propose a meth...
ECML
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We consider the problem of predicting how a user will continue a given initial text fragment. Intuitively, our goal is to develop a “tab-complete” function for natura...