7167 search results - page 1023 / 1434 » Answer Set Programming |
135
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We study – within the framework of propositional proof complexity – the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiabl...
130
Voted
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
This paper studies the gap between classical one-way communication complexity C(f) and its quantum counterpart Q(f), under the unbounded-error setting, i.e., it is enough that the ...
142
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
Motivated by the challenging task of designing “secure” vote storage mechanisms, we study information storage mechanisms that operate in extremely hostile environments. In suc...
107
Voted
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
Exploring a graph through search is one of the most basic building blocks of various applications. In a setting with a huge state space, such as in testing and verification, optim...
148
Voted
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
We propose axiomatizing some stochastic games, in a continuous state space setting, using continuous belief functions, resp. plausibilities, instead of measures. Then, stochastic g...