1894 search results - page 38 / 379 » A TLA Proof System |
FOCS
1999
IEEE
14 years 3 months ago
1999
IEEE
This paper is concerned with the complexity of proofs and of searching for proofs in two propositional proof systems: Resolution and Polynomial Calculus (PC). For the former syste...
ICFEM
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. We present a correctness proof for a basic file system implementation. This implementation contains key elements of standard Unix file systems such as inodes and fixed...
FC
2000
Springer
14 years 2 months ago
2000
Springer
Auditability is an important property in nancial systems and architectures. Here we de ne the primitive of blind auditable membership proof" BAMP which combines public auditab...
IJCAI
1997
14 years 3 days ago
1997
Theoremsin automated theorem proving are usually proved by logical formal proofs. However,there is a subset of problems which humanscan prove in a different wayby the use of geome...
ECCC
2010
13 years 8 months ago
2010
The existence of a (p-)optimal propositional proof system is a major open question in (proof) complexity; many people conjecture that such systems do not exist. Kraj