233 search results - page 2 / 47 » Applications of Polytypism in Theorem Proving |
IJCAI
2003
13 years 6 months ago
2003
TOC
2010
12 years 11 months ago
2010
Abstract: We present a new method for proving lower bounds on quantum query algorithms. The new method is an extension of the adversary method, by analyzing the eigenspace structur...
VVEIS
2008
13 years 6 months ago
2008
This paper presents an executable semantics of OO models. We made it possible to conduct both simulation and theorem proving on the semantics by implementing its underlying heap me...
PSSS
2003
13 years 6 months ago
2003
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...
JFP
2006
13 years 4 months ago
2006
This paper introduces reFLect, a functional programming language with reflection features intended for applications in hardware design and verification. The reFLect language is st...