Sciweavers

3552 search results - page 119 / 711
» Proof theory in the abstract
Sort
View
JACM
2007
160views more  JACM 2007»
15 years 6 months ago
Lossless abstraction of imperfect information games
abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...
Andrew Gilpin, Tuomas Sandholm
SAT
2007
Springer
118views Hardware» more  SAT 2007»
16 years 14 days ago
Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...
Arist Kojevnikov
TPHOL
1999
IEEE
15 years 10 months ago
Three Tactic Theorem Proving
Abstract. We describe the key features of the proof description language of Declare, an experimental theorem prover for higher order logic. We take a somewhat radical approach to p...
Don Syme
CRYPTO
2012
Springer
254views Cryptology» more  CRYPTO 2012»
13 years 8 months ago
Breaking and Repairing GCM Security Proofs
Abstract. In this paper, we study the security proofs of GCM (Galois/Counter Mode of Operation). We first point out that a lemma, which is related to the upper bound on the probab...
Tetsu Iwata, Keisuke Ohashi, Kazuhiko Minematsu
CAV
2011
Springer
234views Hardware» more  CAV 2011»
14 years 10 months ago
Resolution Proofs and Skolem Functions in QBF Evaluation and Applications
Abstract. Quantified Boolean formulae (QBF) allow compact encoding of many decision problems. Their importance motivated the development of fast QBF solvers. Certifying the result...
Valeriy Balabanov, Jie-Hong R. Jiang