769 search results - page 31 / 154 » Where Is the Proof |
154
Voted
CSL
2001
Springer
15 years 8 months ago
2001
Springer
Hyper tableau reasoning is a version of clausal form tableau reasoning where all negative literals in a clause are resolved away in a single inference step. Constrained hyper table...
133
click to vote
CSL
2007
Springer
15 years 10 months ago
2007
Springer
The Prover/Delayer game is a combinatorial game that can be used to prove upper and lower bounds on the size of Tree Resolution proofs, and also perfectly characterizes the space ...
122
Voted
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We prove that every computably enumerable (c.e.) random real is provable in Peano Arithmetic (PA) to be c.e. random. A major step in the proof is to show that the theorem stating ...
178
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
—Real number calculations on elementary functions are remarkably difficult to handle in mechanical proofs. In this paper, we show how these calculations can be performed within a...
131
click to vote
ESORICS
2007
Springer
15 years 7 months ago
2007
Springer
We present a new technique for generating a formal proof that an access request satisfies accesscontrol policy, for use in logic-based access-control frameworks. Our approach is t...