114 search results - page 8 / 23 » Interactive Proof Systems with Polynomially Bounded Strategi... |
SPIN
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We develop an algorithm to compute timed reachability probabilities for distributed models which are both probabilistic and nondeterministic. To obtain realistic results ...
STOC
2010
ACM
14 years 5 months ago
2010
ACM
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
ATAL
2008
Springer
13 years 10 months ago
2008
Springer
We describe how to take a set of interaction traces produced by different pairs of players in a two-player repeated game, and combine them into a composite strategy. We provide an...
AAAI
2006
13 years 9 months ago
2006
Interactive configurators are decision support systems assisting users in selecting values for parameters that respect given constraints. The underlying knowledge can be convenien...
ICALP
2001
Springer
14 years 11 days ago
2001
Springer
We work with an extension of Resolution, called Res(2), that allows clauses with conjunctions of two literals. In this system there are rules to introduce and eliminate such conju...