Sciweavers

1322 search results - page 44 / 265
» Unsound Theorem Proving
Sort
View
CL
2000
Springer
13 years 12 months ago
Proof Planning with Multiple Strategies
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...
Erica Melis, Andreas Meier
ETRICS
2006
13 years 11 months ago
Allowing State Changes in Specifications
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...
Michael Barnett, David A. Naumann, Wolfram Schulte...
ACL
1996
13 years 9 months ago
Higher-Order Coloured Unification and Natural Language Semantics
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...
Claire Gardent, Michael Kohlhase
ECCC
2006
96views more  ECCC 2006»
13 years 7 months ago
An Unconditional Study of Computational Zero Knowledge
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...
Salil P. Vadhan
COMPGEOM
2007
ACM
13 years 11 months ago
An optimal generalization of the centerpoint theorem, and its extensions
We prove an optimal generalization of the centerpoint theorem: given a set P of n points in the plane, there exist two points (not necessarily among input points) that hit all con...
Saurabh Ray, Nabil H. Mustafa