1302 search results - page 54 / 261 » Free-Style Theorem Proving |
INFOCOM
2002
IEEE
14 years 21 days ago
2002
IEEE
—BGP allows routers to use general preference policies for route selection. This paper studies the impact of these policies on convergence time. We first describe a real-time mo...
CL
2000
Springer
14 years 3 days ago
2000
Springer
The control in multi-strategy proof planning goes beyond the control in other automated theorem proving approaches: not only the selection of the inference and the facts for the n...
ETRICS
2006
13 years 11 months ago
2006
Abstract. We provide a static analysis (using both dataflow analysis and theorem proving) to allow state changes within specifications. This can be used for specification languages...
ACL
1996
13 years 9 months ago
1996
In this paper, we show that Higher-Order Coloured Unification - a form of unification developed for automated theorem proving - provides a general theory for modeling the interfac...
ECCC
2006
13 years 7 months ago
2006
We prove a number of general theorems about ZK, the class of problems possessing (computational) zero knowledge proofs. Our results are unconditional, in contrast to most previous...