119 search results - page 23 / 24 » Assertion Application in Theorem Proving and Proof Planning |
COCO
2004
Springer
13 years 9 months ago
2004
Springer
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
BIRTHDAY
1991
Springer
13 years 8 months ago
1991
Springer
The goal of the MKRP project is the development of a theorem prover which can be used as an inference engine in various applications, in particular it should be capable of proving ...
CORR
2002
Springer
13 years 5 months ago
2002
Springer
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
HYBRID
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. In this paper we present algorithms and tools for fast and efficient reachability analysis, applicable to continuous and hybrid systems. Most of the work on reachability ...
ENTCS
2007
13 years 5 months ago
2007
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...