5615 search results - page 819 / 1123 » On the Computational Capabilities of Several Models |
197
click to vote
LFCS
1994
Springer
15 years 11 months ago
1994
Springer
In a previous paper [4], we introduced a non-deterministic -calculus (-LK) whose type system corresponds exactly to Gentzen's cut-free LK [9]. This calculus, however, cannot b...
180
click to vote
ICLP
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. Bottom-up evaluation is a central part of query evaluation / program execution in deductive databases. It is used after a source code optimization like magic sets or SLDm...
187
click to vote
CP
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. Thanks to its extended expressiveness, the quantified constraint satisfaction problem (QCSP) can be used to model problems that are difficult to express in the standard C...
189
click to vote
CRYPTO
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. We consider the problem of random selection, where p players follow a protocol to jointly select a random element of a universe of size n. However, some of the players ma...
215
click to vote
ESOP
2008
Springer
15 years 9 months ago
2008
Springer
This paper defines the cover of a formula with respect to a set of variables V in theory T to be the strongest quantifier-free formula that is implied by V : in theory T. Cover e...