Sciweavers

4352 search results - page 25 / 871
» A Representation Theorem and Applications
Sort
View
ECCC
2006
134views more  ECCC 2006»
13 years 10 months ago
Derandomizing the AW matrix-valued Chernoff bound using pessimistic estimators and applications
Ahlswede and Winter [AW02] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound for real-valued random...
Avi Wigderson, David Xiao
PSSS
2003
14 years 6 hour ago
Extending Classical Theorem Proving for the Semantic Web
We investigate the applicability of classical resolution-based theorem proving methods for the Semantic Web. We consider several well-known search strategies, propose a general sch...
Tanel Tammet
CADE
2009
Springer
14 years 11 months ago
A Generalization of Semenov's Theorem to Automata over Real Numbers
Abstract This work studies the properties of finite automata recognizing vectors with real components, encoded positionally in a given integer numeration base. Such automata are us...
Bernard Boigelot, Jérôme Leroux, Juli...
CADE
1990
Springer
14 years 2 months ago
A Theorem Prover for a Computational Logic
We briefly review a mechanical theorem-prover for a logic of recursive functions over finitely generated objects including the integers, ordered pairs, and symbols. The prover, kn...
Robert S. Boyer, J. Strother Moore
JFP
2006
91views more  JFP 2006»
13 years 10 months ago
A reflective functional language for hardware design and theorem proving
This paper introduces reFLect, a functional programming language with reflection features intended for applications in hardware design and verification. The reFLect language is st...
Jim Grundy, Thomas F. Melham, John W. O'Leary