2181 search results - page 137 / 437 » The restriction scaffold problem |
115
click to vote
LPNMR
2007
Springer
15 years 6 months ago
2007
Springer
Recent research in answer-set programming (ASP) is concerned with the problem of finding faithful transformations of logic programs under the stable semantics. This is in particul...
99
Voted
PPDP
2007
Springer
15 years 6 months ago
2007
Springer
We propose a new definition and use of a primitive getAllValues, for computing all the values of a non-deterministic expression in a functional logic program. Our proposal restri...
90
Voted
CP
2005
Springer
15 years 6 months ago
2005
Springer
QBF is the problem of deciding the satisfiability of quantified boolean formulae in which variables can be either universally or existentially quantified. QBF generalizes SAT (S...
84
Voted
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
Abstract An encryption scheme is non-malleable if the adversary cannot transform a ciphertext into one of a related message under the given public key. Although providing a very st...
107
Voted
STDBM
2004
Springer
15 years 6 months ago
2004
Springer
This paper introduces the Dynamic Cascade Tree (DCT), a structure designed to index query regions on multi-dimensional data streams. The DCT is designed for a stream management sy...