2150 search results - page 125 / 430 » On a restricted cross-intersection problem |
135
Voted
FORMATS
2007
Springer
15 years 11 months ago
2007
Springer
Timed automata were introduced by Alur and Dill in the early 1990s and have since become the most prominent modelling formalism for real-time systems. A fundamental limit to the al...
160
click to vote
LPNMR
2007
Springer
15 years 11 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...
136
click to vote
PPDP
2007
Springer
15 years 11 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...
120
click to vote
CP
2005
Springer
15 years 10 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...
124
click to vote
ICALP
2005
Springer
15 years 10 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...