233 search results - page 27 / 47 » Applications of Polytypism in Theorem Proving |
SIGECOM
2008
ACM
14 years 11 months ago
2008
ACM
We study the question of how to easily recognize whether a social unction f from an abstract type space to a set of outcomes is truthful, i.e. implementable by a truthful mechanis...
112
click to vote
CORR
2007
Springer
14 years 11 months ago
2007
Springer
Local (first order) sentences, introduced by Ressayre, enjoy very nice decidability properties, following from some stretching theorems stating some remarkable links between the ...
108
click to vote
CISC
2007
Springer
15 years 5 months ago
2007
Springer
Deniable authentication is a technique that allows one party to send messages to another while the latter can not prove to a third party the fact of communication. In this paper, w...
125
click to vote
MKM
2004
Springer
15 years 5 months ago
2004
Springer
As the amount of online formal mathematical content grows, for example through active efforts such as the Mathweb [21], MOWGLI [4], Formal Digital Library, or FDL [1], and others, ...
SAT
2004
Springer
15 years 5 months ago
2004
Springer
Kolaitis and Vardi pointed out that constraint satisfaction and conjunctive query containment are essentially the same problem. We study the Boolean conjunctive queries under a mor...